/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:13:43,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:13:43,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:13:43,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:13:43,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:13:43,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:13:43,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:13:43,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:13:43,616 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:13:43,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:13:43,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:13:43,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:13:43,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:13:43,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:13:43,622 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:13:43,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:13:43,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:13:43,622 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:13:43,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:13:43,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:13:43,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:13:43,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:13:43,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:13:43,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:13:43,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:13:43,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:13:43,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:13:43,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:13:43,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:13:43,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:13:43,820 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:13:43,821 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:13:43,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2023-11-17 15:13:44,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:13:44,989 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:13:44,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2023-11-17 15:13:45,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911cd7652/54b06aca7f6f4409ab1beeb700860ed2/FLAG846ed2c30 [2023-11-17 15:13:45,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911cd7652/54b06aca7f6f4409ab1beeb700860ed2 [2023-11-17 15:13:45,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:13:45,020 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:13:45,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:13:45,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:13:45,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:13:45,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb9efc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45, skipping insertion in model container [2023-11-17 15:13:45,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,077 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:13:45,181 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/mix022_tso.i[944,957] [2023-11-17 15:13:45,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:13:45,354 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:13:45,364 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/mix022_tso.i[944,957] [2023-11-17 15:13:45,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:13:45,442 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:13:45,442 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:13:45,448 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:13:45,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45 WrapperNode [2023-11-17 15:13:45,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:13:45,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:13:45,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:13:45,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:13:45,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,506 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2023-11-17 15:13:45,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:13:45,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:13:45,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:13:45,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:13:45,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:13:45,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:13:45,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:13:45,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:13:45,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:13:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:13:45,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:13:45,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:13:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:13:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:13:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:13:45,577 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:13:45,665 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:13:45,666 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:13:45,863 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:13:46,000 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:13:46,001 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:13:46,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:46 BoogieIcfgContainer [2023-11-17 15:13:46,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:13:46,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:13:46,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:13:46,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:13:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:13:45" (1/3) ... [2023-11-17 15:13:46,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289e9b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:46, skipping insertion in model container [2023-11-17 15:13:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (2/3) ... [2023-11-17 15:13:46,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289e9b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:46, skipping insertion in model container [2023-11-17 15:13:46,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:46" (3/3) ... [2023-11-17 15:13:46,010 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2023-11-17 15:13:46,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:13:46,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:13:46,021 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:13:46,062 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:13:46,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 194 flow [2023-11-17 15:13:46,128 INFO L124 PetriNetUnfolderBase]: 3/91 cut-off events. [2023-11-17 15:13:46,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:46,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 3/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-17 15:13:46,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 93 transitions, 194 flow [2023-11-17 15:13:46,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,139 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:13:46,167 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,170 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,183 INFO L124 PetriNetUnfolderBase]: 3/91 cut-off events. [2023-11-17 15:13:46,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:46,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 3/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-17 15:13:46,185 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2023-11-17 15:13:49,602 INFO L134 LiptonReduction]: Checked pairs total: 3191 [2023-11-17 15:13:49,602 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-11-17 15:13:49,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:13:49,617 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@482d41bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:13:49,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:13:49,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:13:49,619 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 15:13:49,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:49,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:49,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:13:49,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:49,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 436372328, now seen corresponding path program 1 times [2023-11-17 15:13:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:49,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866327614] [2023-11-17 15:13:49,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:49,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866327614] [2023-11-17 15:13:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866327614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:49,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105090000] [2023-11-17 15:13:49,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:49,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 179 [2023-11-17 15:13:49,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:49,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:49,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 179 [2023-11-17 15:13:49,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:50,021 INFO L124 PetriNetUnfolderBase]: 142/272 cut-off events. [2023-11-17 15:13:50,022 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 15:13:50,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 272 events. 142/272 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1086 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 527. Up to 205 conditions per place. [2023-11-17 15:13:50,025 INFO L140 encePairwiseOnDemand]: 175/179 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-11-17 15:13:50,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-11-17 15:13:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-11-17 15:13:50,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48789571694599626 [2023-11-17 15:13:50,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-11-17 15:13:50,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-11-17 15:13:50,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:50,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-11-17 15:13:50,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,054 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 262 transitions. [2023-11-17 15:13:50,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-11-17 15:13:50,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:50,057 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-17 15:13:50,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-17 15:13:50,060 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-17 15:13:50,061 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-17 15:13:50,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:50,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:50,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:13:50,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:50,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1552930216, now seen corresponding path program 1 times [2023-11-17 15:13:50,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731061189] [2023-11-17 15:13:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:50,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:50,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731061189] [2023-11-17 15:13:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731061189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:13:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496958990] [2023-11-17 15:13:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:50,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:50,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:50,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 179 [2023-11-17 15:13:50,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:50,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 179 [2023-11-17 15:13:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:50,525 INFO L124 PetriNetUnfolderBase]: 157/278 cut-off events. [2023-11-17 15:13:50,525 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-17 15:13:50,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 278 events. 157/278 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 872 event pairs, 53 based on Foata normal form. 10/288 useless extension candidates. Maximal degree in co-relation 577. Up to 200 conditions per place. [2023-11-17 15:13:50,527 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-11-17 15:13:50,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 96 flow [2023-11-17 15:13:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-11-17 15:13:50,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42830540037243947 [2023-11-17 15:13:50,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-11-17 15:13:50,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-11-17 15:13:50,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:50,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-11-17 15:13:50,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,531 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 230 transitions. [2023-11-17 15:13:50,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 96 flow [2023-11-17 15:13:50,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:50,531 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2023-11-17 15:13:50,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-17 15:13:50,532 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-17 15:13:50,532 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2023-11-17 15:13:50,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:50,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:50,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:13:50,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:50,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2013200471, now seen corresponding path program 1 times [2023-11-17 15:13:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412415518] [2023-11-17 15:13:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412415518] [2023-11-17 15:13:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412415518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:13:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020883613] [2023-11-17 15:13:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:50,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:50,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 179 [2023-11-17 15:13:50,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:50,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 179 [2023-11-17 15:13:50,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:50,798 INFO L124 PetriNetUnfolderBase]: 60/135 cut-off events. [2023-11-17 15:13:50,798 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-17 15:13:50,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 135 events. 60/135 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 468 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 296. Up to 60 conditions per place. [2023-11-17 15:13:50,801 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 20 selfloop transitions, 3 changer transitions 15/40 dead transitions. [2023-11-17 15:13:50,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 179 flow [2023-11-17 15:13:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:13:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:13:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 405 transitions. [2023-11-17 15:13:50,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45251396648044695 [2023-11-17 15:13:50,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 405 transitions. [2023-11-17 15:13:50,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 405 transitions. [2023-11-17 15:13:50,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:50,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 405 transitions. [2023-11-17 15:13:50,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,807 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 5 states and 405 transitions. [2023-11-17 15:13:50,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 179 flow [2023-11-17 15:13:50,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:50,808 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 67 flow [2023-11-17 15:13:50,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-17 15:13:50,809 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2023-11-17 15:13:50,809 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 67 flow [2023-11-17 15:13:50,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:50,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:13:50,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:50,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash -354263816, now seen corresponding path program 1 times [2023-11-17 15:13:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379257279] [2023-11-17 15:13:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379257279] [2023-11-17 15:13:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379257279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423407905] [2023-11-17 15:13:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:50,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:13:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:13:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:13:50,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 179 [2023-11-17 15:13:50,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:50,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 179 [2023-11-17 15:13:50,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:51,057 INFO L124 PetriNetUnfolderBase]: 24/68 cut-off events. [2023-11-17 15:13:51,058 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-17 15:13:51,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 68 events. 24/68 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 178. Up to 29 conditions per place. [2023-11-17 15:13:51,058 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 18 selfloop transitions, 5 changer transitions 8/33 dead transitions. [2023-11-17 15:13:51,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 173 flow [2023-11-17 15:13:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:13:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:13:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2023-11-17 15:13:51,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43854748603351956 [2023-11-17 15:13:51,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 471 transitions. [2023-11-17 15:13:51,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 471 transitions. [2023-11-17 15:13:51,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:51,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 471 transitions. [2023-11-17 15:13:51,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,063 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 67 flow. Second operand 6 states and 471 transitions. [2023-11-17 15:13:51,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 173 flow [2023-11-17 15:13:51,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 154 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-17 15:13:51,066 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 74 flow [2023-11-17 15:13:51,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-11-17 15:13:51,067 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-11-17 15:13:51,067 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 74 flow [2023-11-17 15:13:51,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:51,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:51,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:13:51,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:51,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -462517389, now seen corresponding path program 1 times [2023-11-17 15:13:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132836359] [2023-11-17 15:13:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:51,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132836359] [2023-11-17 15:13:51,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132836359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:51,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:13:51,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295584990] [2023-11-17 15:13:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:51,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:13:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:13:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:13:51,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 179 [2023-11-17 15:13:51,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:51,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 179 [2023-11-17 15:13:51,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:51,546 INFO L124 PetriNetUnfolderBase]: 33/91 cut-off events. [2023-11-17 15:13:51,546 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 15:13:51,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 91 events. 33/91 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 246 event pairs, 0 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 242. Up to 39 conditions per place. [2023-11-17 15:13:51,547 INFO L140 encePairwiseOnDemand]: 173/179 looper letters, 17 selfloop transitions, 3 changer transitions 21/41 dead transitions. [2023-11-17 15:13:51,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 246 flow [2023-11-17 15:13:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 535 transitions. [2023-11-17 15:13:51,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42697525937749403 [2023-11-17 15:13:51,549 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 535 transitions. [2023-11-17 15:13:51,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 535 transitions. [2023-11-17 15:13:51,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:51,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 535 transitions. [2023-11-17 15:13:51,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,552 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,552 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 74 flow. Second operand 7 states and 535 transitions. [2023-11-17 15:13:51,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 246 flow [2023-11-17 15:13:51,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 214 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-17 15:13:51,553 INFO L231 Difference]: Finished difference. Result has 34 places, 18 transitions, 71 flow [2023-11-17 15:13:51,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=71, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2023-11-17 15:13:51,553 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-11-17 15:13:51,554 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 71 flow [2023-11-17 15:13:51,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:51,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:51,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:13:51,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:51,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash -426629599, now seen corresponding path program 2 times [2023-11-17 15:13:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:51,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94841584] [2023-11-17 15:13:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94841584] [2023-11-17 15:13:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94841584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:13:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159577701] [2023-11-17 15:13:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:13:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:13:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:13:52,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 179 [2023-11-17 15:13:52,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 71 flow. Second operand has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:52,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 179 [2023-11-17 15:13:52,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:52,202 INFO L124 PetriNetUnfolderBase]: 12/55 cut-off events. [2023-11-17 15:13:52,203 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-17 15:13:52,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 55 events. 12/55 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 3 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 157. Up to 30 conditions per place. [2023-11-17 15:13:52,203 INFO L140 encePairwiseOnDemand]: 173/179 looper letters, 15 selfloop transitions, 4 changer transitions 7/27 dead transitions. [2023-11-17 15:13:52,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 157 flow [2023-11-17 15:13:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:13:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:13:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2023-11-17 15:13:52,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42793296089385474 [2023-11-17 15:13:52,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 383 transitions. [2023-11-17 15:13:52,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 383 transitions. [2023-11-17 15:13:52,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:52,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 383 transitions. [2023-11-17 15:13:52,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,207 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 71 flow. Second operand 5 states and 383 transitions. [2023-11-17 15:13:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 157 flow [2023-11-17 15:13:52,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 151 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 15:13:52,208 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 79 flow [2023-11-17 15:13:52,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-11-17 15:13:52,208 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-11-17 15:13:52,209 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 79 flow [2023-11-17 15:13:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:52,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:52,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:13:52,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:13:52,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 725175923, now seen corresponding path program 3 times [2023-11-17 15:13:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:52,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482580761] [2023-11-17 15:13:52,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:52,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:13:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:52,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:13:52,301 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:13:52,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:13:52,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:13:52,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:13:52,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:13:52,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:13:52,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:13:52,303 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-17 15:13:52,307 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:13:52,307 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:13:52,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:13:52,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:13:52,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:52 BasicIcfg [2023-11-17 15:13:52,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:13:52,346 INFO L158 Benchmark]: Toolchain (without parser) took 7323.67ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 224.5MB in the beginning and 272.2MB in the end (delta: -47.7MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,347 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:52,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.68ms. Allocated memory is still 278.9MB. Free memory was 224.0MB in the beginning and 200.3MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.78ms. Allocated memory is still 278.9MB. Free memory was 200.3MB in the beginning and 197.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,347 INFO L158 Benchmark]: Boogie Preprocessor took 19.35ms. Allocated memory is still 278.9MB. Free memory was 197.2MB in the beginning and 195.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,347 INFO L158 Benchmark]: RCFGBuilder took 475.70ms. Allocated memory is still 278.9MB. Free memory was 195.7MB in the beginning and 154.2MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,347 INFO L158 Benchmark]: TraceAbstraction took 6338.15ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 153.7MB in the beginning and 272.2MB in the end (delta: -118.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:52,348 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.10ms. Allocated memory is still 187.7MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.68ms. Allocated memory is still 278.9MB. Free memory was 224.0MB in the beginning and 200.3MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.78ms. Allocated memory is still 278.9MB. Free memory was 200.3MB in the beginning and 197.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.35ms. Allocated memory is still 278.9MB. Free memory was 197.2MB in the beginning and 195.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 475.70ms. Allocated memory is still 278.9MB. Free memory was 195.7MB in the beginning and 154.2MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6338.15ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 153.7MB in the beginning and 272.2MB in the end (delta: -118.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 95 PlacesBefore, 25 PlacesAfterwards, 91 TransitionsBefore, 19 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 3191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1436, independent: 1290, independent conditional: 0, independent unconditional: 1290, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 870, independent: 817, independent conditional: 0, independent unconditional: 817, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 870, independent: 797, independent conditional: 0, independent unconditional: 797, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 471, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1436, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 870, unknown conditional: 0, unknown unconditional: 870] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597; [L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 0 pthread_t t598; [L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 x$flush_delayed = weak$$choice2 [L829] 0 x$mem_tmp = x [L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 x = x$flush_delayed ? x$mem_tmp : x [L839] 0 x$flush_delayed = (_Bool)0 [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 6 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=6, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:13:52,369 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...