/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix050.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:05:17,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:05:17,159 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-VariableLbe.epf [2023-08-23 23:05:17,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:05:17,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:05:17,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:05:17,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:05:17,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:05:17,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:05:17,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:05:17,192 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:05:17,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:05:17,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:05:17,194 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:05:17,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:05:17,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:05:17,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:05:17,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:05:17,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:05:17,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:05:17,195 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:05:17,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:05:17,196 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:05:17,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:05:17,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:05:17,196 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:05:17,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:05:17,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:05:17,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:05:17,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:05:17,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:05:17,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:05:17,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:05:17,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:05:17,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:05:17,199 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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-08-23 23:05:17,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:05:17,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:05:17,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:05:17,473 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:05:17,473 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:05:17,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i [2023-08-23 23:05:18,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:05:18,773 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:05:18,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i [2023-08-23 23:05:18,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43203531/fa4b0a2fd7d8438fbc085227ea3daa78/FLAG1710eb642 [2023-08-23 23:05:18,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43203531/fa4b0a2fd7d8438fbc085227ea3daa78 [2023-08-23 23:05:18,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:05:18,807 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:05:18,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:05:18,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:05:18,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:05:18,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:05:18" (1/1) ... [2023-08-23 23:05:18,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf915ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:18, skipping insertion in model container [2023-08-23 23:05:18,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:05:18" (1/1) ... [2023-08-23 23:05:18,849 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:05:18,947 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/mix050.i[940,953] [2023-08-23 23:05:19,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:05:19,116 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:05:19,125 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/mix050.i[940,953] [2023-08-23 23:05:19,142 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:05:19,143 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:05:19,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:05:19,205 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:05:19,205 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:05:19,210 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:05:19,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19 WrapperNode [2023-08-23 23:05:19,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:05:19,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:05:19,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:05:19,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:05:19,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,264 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-23 23:05:19,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:05:19,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:05:19,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:05:19,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:05:19,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:05:19,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:05:19,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:05:19,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:05:19,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (1/1) ... [2023-08-23 23:05:19,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:05:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:05:19,352 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-08-23 23:05:19,371 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-08-23 23:05:19,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:05:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:05:19,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:05:19,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:05:19,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:05:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 23:05:19,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 23:05:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:05:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:05:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:05:19,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:05:19,388 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:05:19,517 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:05:19,518 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:05:19,788 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:05:19,877 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:05:19,877 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:05:19,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:05:19 BoogieIcfgContainer [2023-08-23 23:05:19,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:05:19,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:05:19,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:05:19,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:05:19,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:05:18" (1/3) ... [2023-08-23 23:05:19,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29da792a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:05:19, skipping insertion in model container [2023-08-23 23:05:19,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:05:19" (2/3) ... [2023-08-23 23:05:19,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29da792a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:05:19, skipping insertion in model container [2023-08-23 23:05:19,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:05:19" (3/3) ... [2023-08-23 23:05:19,885 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2023-08-23 23:05:19,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:05:19,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:05:19,897 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:05:19,933 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:05:19,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-23 23:05:19,985 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-23 23:05:19,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:05:19,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-23 23:05:19,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-23 23:05:19,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-23 23:05:19,993 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:05:19,999 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-23 23:05:20,000 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-23 23:05:20,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-23 23:05:20,043 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-23 23:05:20,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:05:20,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-23 23:05:20,046 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-08-23 23:05:23,110 INFO L134 LiptonReduction]: Checked pairs total: 8842 [2023-08-23 23:05:23,110 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-23 23:05:23,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:05:23,122 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=LoopsAndPotentialCycles, 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;@6a8c0cb9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:05:23,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 23:05:23,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:05:23,141 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-23 23:05:23,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:05:23,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:23,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-23 23:05:23,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:23,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash 547453, now seen corresponding path program 1 times [2023-08-23 23:05:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688715001] [2023-08-23 23:05:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688715001] [2023-08-23 23:05:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688715001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:05:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861187948] [2023-08-23 23:05:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:23,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:05:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:23,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:05:23,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:05:23,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 240 [2023-08-23 23:05:23,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:23,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:23,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 240 [2023-08-23 23:05:23,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:24,259 INFO L124 PetriNetUnfolderBase]: 4903/7118 cut-off events. [2023-08-23 23:05:24,260 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-23 23:05:24,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 7118 events. 4903/7118 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 41445 event pairs, 895 based on Foata normal form. 0/6793 useless extension candidates. Maximal degree in co-relation 13954. Up to 5335 conditions per place. [2023-08-23 23:05:24,291 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-23 23:05:24,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-08-23 23:05:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:05:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:05:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-23 23:05:24,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-08-23 23:05:24,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-23 23:05:24,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-23 23:05:24,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:24,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-23 23:05:24,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:24,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:24,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:24,311 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 390 transitions. [2023-08-23 23:05:24,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-08-23 23:05:24,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 23:05:24,315 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-23 23:05:24,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-23 23:05:24,318 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-23 23:05:24,319 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-23 23:05:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:24,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:24,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:05:24,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:24,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash 128778335, now seen corresponding path program 1 times [2023-08-23 23:05:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312248510] [2023-08-23 23:05:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:24,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-08-23 23:05:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312248510] [2023-08-23 23:05:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312248510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:05:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330062472] [2023-08-23 23:05:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:24,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:05:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:05:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:05:24,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 240 [2023-08-23 23:05:24,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:24,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:24,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 240 [2023-08-23 23:05:24,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:24,984 INFO L124 PetriNetUnfolderBase]: 3395/4853 cut-off events. [2023-08-23 23:05:24,985 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-08-23 23:05:24,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10201 conditions, 4853 events. 3395/4853 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25154 event pairs, 634 based on Foata normal form. 320/5159 useless extension candidates. Maximal degree in co-relation 10191. Up to 3244 conditions per place. [2023-08-23 23:05:25,006 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 38 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2023-08-23 23:05:25,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 310 flow [2023-08-23 23:05:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:05:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:05:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-23 23:05:25,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058333333333334 [2023-08-23 23:05:25,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-23 23:05:25,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-23 23:05:25,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:25,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-23 23:05:25,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,015 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 607 transitions. [2023-08-23 23:05:25,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 310 flow [2023-08-23 23:05:25,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:05:25,016 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 107 flow [2023-08-23 23:05:25,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-23 23:05:25,018 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-23 23:05:25,020 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 107 flow [2023-08-23 23:05:25,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:25,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:25,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:05:25,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:25,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1019116965, now seen corresponding path program 1 times [2023-08-23 23:05:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532535911] [2023-08-23 23:05:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532535911] [2023-08-23 23:05:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532535911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:05:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276292054] [2023-08-23 23:05:25,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:25,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:05:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:05:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:05:25,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 240 [2023-08-23 23:05:25,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:25,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 240 [2023-08-23 23:05:25,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:25,494 INFO L124 PetriNetUnfolderBase]: 1883/2829 cut-off events. [2023-08-23 23:05:25,494 INFO L125 PetriNetUnfolderBase]: For 942/942 co-relation queries the response was YES. [2023-08-23 23:05:25,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 2829 events. 1883/2829 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14223 event pairs, 373 based on Foata normal form. 212/3027 useless extension candidates. Maximal degree in co-relation 7606. Up to 994 conditions per place. [2023-08-23 23:05:25,507 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 51 selfloop transitions, 9 changer transitions 27/90 dead transitions. [2023-08-23 23:05:25,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 90 transitions, 459 flow [2023-08-23 23:05:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:05:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:05:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-23 23:05:25,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076388888888889 [2023-08-23 23:05:25,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-23 23:05:25,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-23 23:05:25,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:25,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-23 23:05:25,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,513 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,513 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 107 flow. Second operand 6 states and 731 transitions. [2023-08-23 23:05:25,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 90 transitions, 459 flow [2023-08-23 23:05:25,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 90 transitions, 452 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:05:25,524 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 172 flow [2023-08-23 23:05:25,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-23 23:05:25,526 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-23 23:05:25,526 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 172 flow [2023-08-23 23:05:25,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:25,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:25,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:05:25,527 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:25,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1228858763, now seen corresponding path program 1 times [2023-08-23 23:05:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:25,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736056548] [2023-08-23 23:05:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:25,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736056548] [2023-08-23 23:05:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736056548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:25,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:05:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559657566] [2023-08-23 23:05:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:05:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:05:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:05:25,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 240 [2023-08-23 23:05:25,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:25,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:25,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 240 [2023-08-23 23:05:25,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:26,089 INFO L124 PetriNetUnfolderBase]: 1163/1785 cut-off events. [2023-08-23 23:05:26,090 INFO L125 PetriNetUnfolderBase]: For 1730/1730 co-relation queries the response was YES. [2023-08-23 23:05:26,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 1785 events. 1163/1785 cut-off events. For 1730/1730 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8480 event pairs, 329 based on Foata normal form. 77/1848 useless extension candidates. Maximal degree in co-relation 5402. Up to 630 conditions per place. [2023-08-23 23:05:26,098 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 62 selfloop transitions, 13 changer transitions 27/105 dead transitions. [2023-08-23 23:05:26,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 105 transitions, 628 flow [2023-08-23 23:05:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:05:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:05:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-08-23 23:05:26,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077380952380952 [2023-08-23 23:05:26,101 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-08-23 23:05:26,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-08-23 23:05:26,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:26,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-08-23 23:05:26,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,118 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 172 flow. Second operand 7 states and 853 transitions. [2023-08-23 23:05:26,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 105 transitions, 628 flow [2023-08-23 23:05:26,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 105 transitions, 566 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-23 23:05:26,131 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 222 flow [2023-08-23 23:05:26,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-23 23:05:26,132 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-08-23 23:05:26,132 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 222 flow [2023-08-23 23:05:26,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:26,133 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-08-23 23:05:26,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:05:26,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:26,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash -696967962, now seen corresponding path program 1 times [2023-08-23 23:05:26,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:26,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054397563] [2023-08-23 23:05:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054397563] [2023-08-23 23:05:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054397563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:26,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:26,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:05:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459019649] [2023-08-23 23:05:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:26,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:05:26,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:26,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:05:26,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:05:26,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 240 [2023-08-23 23:05:26,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:26,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 240 [2023-08-23 23:05:26,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:26,550 INFO L124 PetriNetUnfolderBase]: 1011/1531 cut-off events. [2023-08-23 23:05:26,551 INFO L125 PetriNetUnfolderBase]: For 1455/1455 co-relation queries the response was YES. [2023-08-23 23:05:26,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 1531 events. 1011/1531 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7100 event pairs, 326 based on Foata normal form. 14/1531 useless extension candidates. Maximal degree in co-relation 4464. Up to 630 conditions per place. [2023-08-23 23:05:26,559 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 58 selfloop transitions, 17 changer transitions 14/92 dead transitions. [2023-08-23 23:05:26,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 564 flow [2023-08-23 23:05:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:05:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:05:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 947 transitions. [2023-08-23 23:05:26,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49322916666666666 [2023-08-23 23:05:26,562 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 947 transitions. [2023-08-23 23:05:26,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 947 transitions. [2023-08-23 23:05:26,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:26,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 947 transitions. [2023-08-23 23:05:26,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,566 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,566 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 222 flow. Second operand 8 states and 947 transitions. [2023-08-23 23:05:26,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 564 flow [2023-08-23 23:05:26,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 502 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-23 23:05:26,594 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 216 flow [2023-08-23 23:05:26,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-23 23:05:26,595 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-23 23:05:26,595 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 216 flow [2023-08-23 23:05:26,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:26,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:26,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:26,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:05:26,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:26,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 748678022, now seen corresponding path program 1 times [2023-08-23 23:05:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611747725] [2023-08-23 23:05:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611747725] [2023-08-23 23:05:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611747725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:05:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028793711] [2023-08-23 23:05:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:27,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:05:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:05:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:05:27,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 240 [2023-08-23 23:05:27,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:27,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:27,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 240 [2023-08-23 23:05:27,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:27,918 INFO L124 PetriNetUnfolderBase]: 1457/2344 cut-off events. [2023-08-23 23:05:27,919 INFO L125 PetriNetUnfolderBase]: For 2831/2831 co-relation queries the response was YES. [2023-08-23 23:05:27,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 2344 events. 1457/2344 cut-off events. For 2831/2831 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12875 event pairs, 173 based on Foata normal form. 1/2340 useless extension candidates. Maximal degree in co-relation 6979. Up to 775 conditions per place. [2023-08-23 23:05:27,926 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 95 selfloop transitions, 4 changer transitions 31/133 dead transitions. [2023-08-23 23:05:27,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 133 transitions, 1032 flow [2023-08-23 23:05:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:05:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:05:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 695 transitions. [2023-08-23 23:05:27,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2023-08-23 23:05:27,928 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 695 transitions. [2023-08-23 23:05:27,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 695 transitions. [2023-08-23 23:05:27,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:27,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 695 transitions. [2023-08-23 23:05:27,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:27,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:27,931 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:27,931 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 216 flow. Second operand 6 states and 695 transitions. [2023-08-23 23:05:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 133 transitions, 1032 flow [2023-08-23 23:05:27,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 133 transitions, 814 flow, removed 57 selfloop flow, removed 7 redundant places. [2023-08-23 23:05:27,942 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 176 flow [2023-08-23 23:05:27,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-23 23:05:27,943 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-23 23:05:27,943 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 176 flow [2023-08-23 23:05:27,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:27,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:27,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:27,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:05:27,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:27,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1712724858, now seen corresponding path program 2 times [2023-08-23 23:05:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:27,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195967553] [2023-08-23 23:05:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:27,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195967553] [2023-08-23 23:05:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195967553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:05:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728867310] [2023-08-23 23:05:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:28,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:05:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:28,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:05:28,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:05:28,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 240 [2023-08-23 23:05:28,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:28,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:28,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 240 [2023-08-23 23:05:28,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:28,524 INFO L124 PetriNetUnfolderBase]: 3711/5549 cut-off events. [2023-08-23 23:05:28,524 INFO L125 PetriNetUnfolderBase]: For 4796/4796 co-relation queries the response was YES. [2023-08-23 23:05:28,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16369 conditions, 5549 events. 3711/5549 cut-off events. For 4796/4796 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 30166 event pairs, 300 based on Foata normal form. 2/5551 useless extension candidates. Maximal degree in co-relation 16353. Up to 3271 conditions per place. [2023-08-23 23:05:28,538 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 87 selfloop transitions, 5 changer transitions 6/98 dead transitions. [2023-08-23 23:05:28,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 623 flow [2023-08-23 23:05:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:05:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:05:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-23 23:05:28,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2023-08-23 23:05:28,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-23 23:05:28,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-23 23:05:28,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:28,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-23 23:05:28,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:28,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:28,542 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:28,542 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 176 flow. Second operand 4 states and 483 transitions. [2023-08-23 23:05:28,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 623 flow [2023-08-23 23:05:28,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 614 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-23 23:05:28,573 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 209 flow [2023-08-23 23:05:28,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-23 23:05:28,573 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-23 23:05:28,573 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 209 flow [2023-08-23 23:05:28,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:28,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:28,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:28,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:05:28,574 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:28,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1498694090, now seen corresponding path program 3 times [2023-08-23 23:05:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959127525] [2023-08-23 23:05:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:28,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959127525] [2023-08-23 23:05:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959127525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:05:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625294280] [2023-08-23 23:05:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:28,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:05:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:05:28,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:05:28,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 240 [2023-08-23 23:05:28,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:28,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:28,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 240 [2023-08-23 23:05:28,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:29,289 INFO L124 PetriNetUnfolderBase]: 4804/7210 cut-off events. [2023-08-23 23:05:29,289 INFO L125 PetriNetUnfolderBase]: For 8525/8525 co-relation queries the response was YES. [2023-08-23 23:05:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23510 conditions, 7210 events. 4804/7210 cut-off events. For 8525/8525 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 39966 event pairs, 632 based on Foata normal form. 2/7212 useless extension candidates. Maximal degree in co-relation 23492. Up to 4631 conditions per place. [2023-08-23 23:05:29,309 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 87 selfloop transitions, 6 changer transitions 6/99 dead transitions. [2023-08-23 23:05:29,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 672 flow [2023-08-23 23:05:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:05:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:05:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-23 23:05:29,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49895833333333334 [2023-08-23 23:05:29,311 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-23 23:05:29,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-23 23:05:29,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:29,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-23 23:05:29,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:29,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:29,313 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:29,313 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 209 flow. Second operand 4 states and 479 transitions. [2023-08-23 23:05:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 672 flow [2023-08-23 23:05:29,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:05:29,389 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 269 flow [2023-08-23 23:05:29,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-23 23:05:29,389 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-08-23 23:05:29,389 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 269 flow [2023-08-23 23:05:29,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:29,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:29,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:29,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:05:29,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:29,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 272770392, now seen corresponding path program 4 times [2023-08-23 23:05:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130403083] [2023-08-23 23:05:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:29,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130403083] [2023-08-23 23:05:29,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130403083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:29,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:29,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:05:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091983016] [2023-08-23 23:05:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:05:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:05:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:05:29,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-08-23 23:05:29,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:29,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:29,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-08-23 23:05:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:30,146 INFO L124 PetriNetUnfolderBase]: 5053/7915 cut-off events. [2023-08-23 23:05:30,146 INFO L125 PetriNetUnfolderBase]: For 12021/12250 co-relation queries the response was YES. [2023-08-23 23:05:30,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27130 conditions, 7915 events. 5053/7915 cut-off events. For 12021/12250 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 50074 event pairs, 1709 based on Foata normal form. 11/7792 useless extension candidates. Maximal degree in co-relation 27110. Up to 3058 conditions per place. [2023-08-23 23:05:30,173 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 59 selfloop transitions, 1 changer transitions 32/99 dead transitions. [2023-08-23 23:05:30,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 716 flow [2023-08-23 23:05:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:05:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:05:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-23 23:05:30,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509375 [2023-08-23 23:05:30,174 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-23 23:05:30,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-23 23:05:30,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:30,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-23 23:05:30,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:30,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:30,177 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:30,177 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 269 flow. Second operand 4 states and 489 transitions. [2023-08-23 23:05:30,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 716 flow [2023-08-23 23:05:30,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 706 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-23 23:05:30,364 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 275 flow [2023-08-23 23:05:30,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-23 23:05:30,365 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-08-23 23:05:30,365 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 275 flow [2023-08-23 23:05:30,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:30,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:30,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:30,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:05:30,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:30,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1688642264, now seen corresponding path program 5 times [2023-08-23 23:05:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:30,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886114396] [2023-08-23 23:05:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:05:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:05:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:05:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886114396] [2023-08-23 23:05:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886114396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:05:30,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:05:30,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:05:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995414614] [2023-08-23 23:05:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:05:30,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:05:30,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:05:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:05:30,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:05:30,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 240 [2023-08-23 23:05:30,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:30,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:05:30,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 240 [2023-08-23 23:05:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:05:31,772 INFO L124 PetriNetUnfolderBase]: 5165/8431 cut-off events. [2023-08-23 23:05:31,772 INFO L125 PetriNetUnfolderBase]: For 11729/11869 co-relation queries the response was YES. [2023-08-23 23:05:31,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28741 conditions, 8431 events. 5165/8431 cut-off events. For 11729/11869 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 57896 event pairs, 285 based on Foata normal form. 31/8343 useless extension candidates. Maximal degree in co-relation 28719. Up to 3071 conditions per place. [2023-08-23 23:05:31,807 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 108 selfloop transitions, 14 changer transitions 59/191 dead transitions. [2023-08-23 23:05:31,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 191 transitions, 1351 flow [2023-08-23 23:05:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:05:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:05:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 944 transitions. [2023-08-23 23:05:31,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-08-23 23:05:31,809 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 944 transitions. [2023-08-23 23:05:31,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 944 transitions. [2023-08-23 23:05:31,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:05:31,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 944 transitions. [2023-08-23 23:05:31,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:31,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:31,813 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:31,813 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 275 flow. Second operand 8 states and 944 transitions. [2023-08-23 23:05:31,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 191 transitions, 1351 flow [2023-08-23 23:05:32,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 191 transitions, 1344 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:05:32,032 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 412 flow [2023-08-23 23:05:32,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=412, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2023-08-23 23:05:32,034 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-23 23:05:32,034 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 412 flow [2023-08-23 23:05:32,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:05:32,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:05:32,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:05:32,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:05:32,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:05:32,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:05:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -202457988, now seen corresponding path program 6 times [2023-08-23 23:05:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:05:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359914497] [2023-08-23 23:05:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:05:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:05:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:05:32,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:05:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:05:32,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:05:32,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:05:32,172 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 23:05:32,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 23:05:32,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 23:05:32,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 23:05:32,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 23:05:32,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 23:05:32,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 23:05:32,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:05:32,174 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2023-08-23 23:05:32,177 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:05:32,177 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:05:32,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:05:32 BasicIcfg [2023-08-23 23:05:32,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:05:32,240 INFO L158 Benchmark]: Toolchain (without parser) took 13433.65ms. Allocated memory was 381.7MB in the beginning and 1.0GB in the end (delta: 643.8MB). Free memory was 356.1MB in the beginning and 493.0MB in the end (delta: -136.8MB). Peak memory consumption was 508.0MB. Max. memory is 16.0GB. [2023-08-23 23:05:32,240 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 381.7MB. Free memory was 359.2MB in the beginning and 359.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:05:32,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.29ms. Allocated memory is still 381.7MB. Free memory was 356.1MB in the beginning and 332.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:05:32,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.06ms. Allocated memory is still 381.7MB. Free memory was 332.0MB in the beginning and 329.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 23:05:32,247 INFO L158 Benchmark]: Boogie Preprocessor took 40.94ms. Allocated memory is still 381.7MB. Free memory was 329.1MB in the beginning and 327.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:05:32,249 INFO L158 Benchmark]: RCFGBuilder took 572.01ms. Allocated memory is still 381.7MB. Free memory was 327.0MB in the beginning and 287.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-23 23:05:32,249 INFO L158 Benchmark]: TraceAbstraction took 12358.77ms. Allocated memory was 381.7MB in the beginning and 1.0GB in the end (delta: 643.8MB). Free memory was 286.3MB in the beginning and 493.0MB in the end (delta: -206.7MB). Peak memory consumption was 438.8MB. Max. memory is 16.0GB. [2023-08-23 23:05:32,250 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.09ms. Allocated memory is still 381.7MB. Free memory was 359.2MB in the beginning and 359.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 403.29ms. Allocated memory is still 381.7MB. Free memory was 356.1MB in the beginning and 332.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.06ms. Allocated memory is still 381.7MB. Free memory was 332.0MB in the beginning and 329.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.94ms. Allocated memory is still 381.7MB. Free memory was 329.1MB in the beginning and 327.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 572.01ms. Allocated memory is still 381.7MB. Free memory was 327.0MB in the beginning and 287.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 12358.77ms. Allocated memory was 381.7MB in the beginning and 1.0GB in the end (delta: 643.8MB). Free memory was 286.3MB in the beginning and 493.0MB in the end (delta: -206.7MB). Peak memory consumption was 438.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3505, independent: 3269, independent conditional: 0, independent unconditional: 3269, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1647, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3505, independent: 1669, independent conditional: 0, independent unconditional: 1669, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1647, unknown conditional: 0, unknown unconditional: 1647] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1321, ((void *)0), P0, ((void *)0))=-4, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=-3, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=-2, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1324; [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=-1, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=1, z=1] [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 13 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 23:05:32,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...