/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/mix009.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:31,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:31,516 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:12:31,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:31,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:31,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:31,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:31,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:31,544 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:31,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:31,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:31,548 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:31,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:31,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:31,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:31,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:31,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:31,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:31,550 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:31,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:31,550 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:31,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:31,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:31,551 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:31,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:31,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:31,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:31,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:31,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:31,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:31,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:31,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:31,554 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:12:31,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:31,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:31,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:31,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:31,779 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:31,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2023-11-17 15:12:32,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:33,080 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:33,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2023-11-17 15:12:33,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ea906fb/9eaf671c0ea44297b625a6796f471cff/FLAG895580476 [2023-11-17 15:12:33,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ea906fb/9eaf671c0ea44297b625a6796f471cff [2023-11-17 15:12:33,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:33,120 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:33,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:33,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:33,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:33,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33, skipping insertion in model container [2023-11-17 15:12:33,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:33,298 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/mix009.opt.i[987,1000] [2023-11-17 15:12:33,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:33,467 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:33,475 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/mix009.opt.i[987,1000] [2023-11-17 15:12:33,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:33,553 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:33,554 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:33,558 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:33,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33 WrapperNode [2023-11-17 15:12:33,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:33,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:33,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:33,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:33,565 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:12:33" (1/1) ... [2023-11-17 15:12:33,580 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:12:33" (1/1) ... [2023-11-17 15:12:33,607 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-11-17 15:12:33,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:33,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:33,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:33,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:33,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:33,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:33,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:33,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:33,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (1/1) ... [2023-11-17 15:12:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:33,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:33,709 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:12:33,728 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:12:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:33,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:33,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:33,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:33,760 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:12:33,909 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:33,910 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:12:34,259 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:12:34,367 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:12:34,368 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:12:34,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:34 BoogieIcfgContainer [2023-11-17 15:12:34,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:12:34,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:12:34,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:12:34,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:12:34,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:33" (1/3) ... [2023-11-17 15:12:34,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26287dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:34, skipping insertion in model container [2023-11-17 15:12:34,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:33" (2/3) ... [2023-11-17 15:12:34,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26287dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:34, skipping insertion in model container [2023-11-17 15:12:34,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:34" (3/3) ... [2023-11-17 15:12:34,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-17 15:12:34,389 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:12:34,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:12:34,389 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:12:34,433 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:12:34,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 202 flow [2023-11-17 15:12:34,512 INFO L124 PetriNetUnfolderBase]: 2/95 cut-off events. [2023-11-17 15:12:34,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:34,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:12:34,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 202 flow [2023-11-17 15:12:34,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2023-11-17 15:12:34,524 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:12:34,537 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 196 flow [2023-11-17 15:12:34,540 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 196 flow [2023-11-17 15:12:34,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 196 flow [2023-11-17 15:12:34,569 INFO L124 PetriNetUnfolderBase]: 2/95 cut-off events. [2023-11-17 15:12:34,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:34,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:12:34,572 INFO L119 LiptonReduction]: Number of co-enabled transitions 1404 [2023-11-17 15:12:37,456 INFO L134 LiptonReduction]: Checked pairs total: 3074 [2023-11-17 15:12:37,457 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-11-17 15:12:37,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:12:37,472 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;@78e9f766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:12:37,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:12:37,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:12:37,474 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 15:12:37,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:37,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:37,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:12:37,475 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:12:37,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 439201566, now seen corresponding path program 1 times [2023-11-17 15:12:37,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:37,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901766709] [2023-11-17 15:12:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:37,791 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:12:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901766709] [2023-11-17 15:12:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901766709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:37,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:37,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732819100] [2023-11-17 15:12:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:37,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:37,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:37,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 183 [2023-11-17 15:12:37,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:12:37,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:37,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 183 [2023-11-17 15:12:37,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:37,955 INFO L124 PetriNetUnfolderBase]: 224/415 cut-off events. [2023-11-17 15:12:37,956 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 15:12:37,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 415 events. 224/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1666 event pairs, 28 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 806. Up to 317 conditions per place. [2023-11-17 15:12:37,960 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-11-17 15:12:37,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 112 flow [2023-11-17 15:12:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-11-17 15:12:37,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517304189435337 [2023-11-17 15:12:37,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-11-17 15:12:37,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-11-17 15:12:37,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:37,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-11-17 15:12:37,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:12:37,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:12:37,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:12:37,989 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 284 transitions. [2023-11-17 15:12:37,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 27 transitions, 112 flow [2023-11-17 15:12:37,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:37,992 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-17 15:12:37,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-17 15:12:37,996 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-17 15:12:37,997 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-17 15:12:37,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:12:37,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:37,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:37,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:12:37,997 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:12:37,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1785732369, now seen corresponding path program 1 times [2023-11-17 15:12:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058884569] [2023-11-17 15:12:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:38,172 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:12:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058884569] [2023-11-17 15:12:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058884569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:38,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:38,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33374513] [2023-11-17 15:12:38,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:38,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:38,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:38,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:38,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 183 [2023-11-17 15:12:38,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:12:38,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:38,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 183 [2023-11-17 15:12:38,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:38,304 INFO L124 PetriNetUnfolderBase]: 231/414 cut-off events. [2023-11-17 15:12:38,305 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-17 15:12:38,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 414 events. 231/414 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1556 event pairs, 103 based on Foata normal form. 30/444 useless extension candidates. Maximal degree in co-relation 860. Up to 334 conditions per place. [2023-11-17 15:12:38,308 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 22 selfloop transitions, 3 changer transitions 14/39 dead transitions. [2023-11-17 15:12:38,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 172 flow [2023-11-17 15:12:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2023-11-17 15:12:38,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601092896174863 [2023-11-17 15:12:38,311 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 421 transitions. [2023-11-17 15:12:38,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 421 transitions. [2023-11-17 15:12:38,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:38,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 421 transitions. [2023-11-17 15:12:38,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 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:12:38,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:12:38,316 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:12:38,316 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 5 states and 421 transitions. [2023-11-17 15:12:38,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 172 flow [2023-11-17 15:12:38,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:38,317 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 65 flow [2023-11-17 15:12:38,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-11-17 15:12:38,318 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-11-17 15:12:38,319 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 65 flow [2023-11-17 15:12:38,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:12:38,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:38,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:12:38,320 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:12:38,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash 676142524, now seen corresponding path program 1 times [2023-11-17 15:12:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531201119] [2023-11-17 15:12:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:38,450 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:12:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531201119] [2023-11-17 15:12:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531201119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:38,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139651231] [2023-11-17 15:12:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:38,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:38,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:38,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:38,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 183 [2023-11-17 15:12:38,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:12:38,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:38,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 183 [2023-11-17 15:12:38,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:38,548 INFO L124 PetriNetUnfolderBase]: 161/310 cut-off events. [2023-11-17 15:12:38,548 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-17 15:12:38,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 310 events. 161/310 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1161 event pairs, 58 based on Foata normal form. 15/325 useless extension candidates. Maximal degree in co-relation 741. Up to 186 conditions per place. [2023-11-17 15:12:38,551 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 20 selfloop transitions, 3 changer transitions 9/33 dead transitions. [2023-11-17 15:12:38,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 163 flow [2023-11-17 15:12:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2023-11-17 15:12:38,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786885245901639 [2023-11-17 15:12:38,552 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 438 transitions. [2023-11-17 15:12:38,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 438 transitions. [2023-11-17 15:12:38,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:38,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 438 transitions. [2023-11-17 15:12:38,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 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:12:38,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:12:38,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:12:38,555 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 65 flow. Second operand 5 states and 438 transitions. [2023-11-17 15:12:38,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 163 flow [2023-11-17 15:12:38,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 154 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:38,557 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 73 flow [2023-11-17 15:12:38,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2023-11-17 15:12:38,559 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-11-17 15:12:38,559 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 73 flow [2023-11-17 15:12:38,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:12:38,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:38,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:38,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:12:38,560 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:12:38,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 648431449, now seen corresponding path program 1 times [2023-11-17 15:12:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:38,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640891828] [2023-11-17 15:12:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:39,184 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:12:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640891828] [2023-11-17 15:12:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640891828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:39,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:39,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623953756] [2023-11-17 15:12:39,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:39,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:12:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:12:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:12:39,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 183 [2023-11-17 15:12:39,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 69.42857142857143) internal successors, (486), 7 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:12:39,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:39,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 183 [2023-11-17 15:12:39,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:39,401 INFO L124 PetriNetUnfolderBase]: 205/370 cut-off events. [2023-11-17 15:12:39,401 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2023-11-17 15:12:39,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 370 events. 205/370 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1321 event pairs, 98 based on Foata normal form. 20/390 useless extension candidates. Maximal degree in co-relation 960. Up to 296 conditions per place. [2023-11-17 15:12:39,403 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 27 selfloop transitions, 10 changer transitions 11/48 dead transitions. [2023-11-17 15:12:39,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 254 flow [2023-11-17 15:12:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 525 transitions. [2023-11-17 15:12:39,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4098360655737705 [2023-11-17 15:12:39,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 525 transitions. [2023-11-17 15:12:39,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 525 transitions. [2023-11-17 15:12:39,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:39,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 525 transitions. [2023-11-17 15:12:39,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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:12:39,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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:12:39,422 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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:12:39,422 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 73 flow. Second operand 7 states and 525 transitions. [2023-11-17 15:12:39,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 254 flow [2023-11-17 15:12:39,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 242 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:39,424 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 136 flow [2023-11-17 15:12:39,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-11-17 15:12:39,424 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-11-17 15:12:39,425 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 136 flow [2023-11-17 15:12:39,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.42857142857143) internal successors, (486), 7 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:12:39,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:39,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:39,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:12:39,425 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:12:39,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1899293697, now seen corresponding path program 2 times [2023-11-17 15:12:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:39,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518243103] [2023-11-17 15:12:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518243103] [2023-11-17 15:12:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518243103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702619352] [2023-11-17 15:12:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:39,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:39,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 183 [2023-11-17 15:12:39,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:39,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:39,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 183 [2023-11-17 15:12:39,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:39,659 INFO L124 PetriNetUnfolderBase]: 183/332 cut-off events. [2023-11-17 15:12:39,659 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2023-11-17 15:12:39,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 332 events. 183/332 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1120 event pairs, 120 based on Foata normal form. 20/352 useless extension candidates. Maximal degree in co-relation 1009. Up to 208 conditions per place. [2023-11-17 15:12:39,661 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 28 selfloop transitions, 6 changer transitions 11/45 dead transitions. [2023-11-17 15:12:39,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 296 flow [2023-11-17 15:12:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2023-11-17 15:12:39,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45792349726775955 [2023-11-17 15:12:39,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions. [2023-11-17 15:12:39,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions. [2023-11-17 15:12:39,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:39,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions. [2023-11-17 15:12:39,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 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:12:39,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:12:39,665 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:12:39,665 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 136 flow. Second operand 5 states and 419 transitions. [2023-11-17 15:12:39,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 296 flow [2023-11-17 15:12:39,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 281 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:39,667 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 147 flow [2023-11-17 15:12:39,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-11-17 15:12:39,668 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-11-17 15:12:39,668 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 147 flow [2023-11-17 15:12:39,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:39,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:39,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:39,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:12:39,669 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:12:39,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1285345762, now seen corresponding path program 1 times [2023-11-17 15:12:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:39,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289435101] [2023-11-17 15:12:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:39,769 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:12:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289435101] [2023-11-17 15:12:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289435101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511511089] [2023-11-17 15:12:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:39,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-11-17 15:12:39,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:12:39,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:39,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-11-17 15:12:39,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:39,838 INFO L124 PetriNetUnfolderBase]: 51/121 cut-off events. [2023-11-17 15:12:39,839 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-11-17 15:12:39,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 121 events. 51/121 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 334 event pairs, 18 based on Foata normal form. 16/136 useless extension candidates. Maximal degree in co-relation 378. Up to 75 conditions per place. [2023-11-17 15:12:39,839 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 28 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-11-17 15:12:39,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 223 flow [2023-11-17 15:12:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-17 15:12:39,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972677595628415 [2023-11-17 15:12:39,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-17 15:12:39,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-17 15:12:39,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:39,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-17 15:12:39,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:12:39,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:12:39,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:12:39,842 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 147 flow. Second operand 3 states and 273 transitions. [2023-11-17 15:12:39,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 223 flow [2023-11-17 15:12:39,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 195 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-17 15:12:39,844 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 120 flow [2023-11-17 15:12:39,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-11-17 15:12:39,845 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-11-17 15:12:39,845 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 120 flow [2023-11-17 15:12:39,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:12:39,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:39,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:39,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:12:39,845 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:12:39,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash 39071236, now seen corresponding path program 1 times [2023-11-17 15:12:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587454588] [2023-11-17 15:12:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:40,062 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:12:40,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:40,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587454588] [2023-11-17 15:12:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587454588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:40,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:40,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577256397] [2023-11-17 15:12:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:40,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:40,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-11-17 15:12:40,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:12:40,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:40,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-11-17 15:12:40,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:40,114 INFO L124 PetriNetUnfolderBase]: 25/69 cut-off events. [2023-11-17 15:12:40,115 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-17 15:12:40,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 69 events. 25/69 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 12 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 216. Up to 41 conditions per place. [2023-11-17 15:12:40,115 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 26 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-11-17 15:12:40,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 210 flow [2023-11-17 15:12:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2023-11-17 15:12:40,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849726775956284 [2023-11-17 15:12:40,117 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 355 transitions. [2023-11-17 15:12:40,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 355 transitions. [2023-11-17 15:12:40,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:40,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 355 transitions. [2023-11-17 15:12:40,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:12:40,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:12:40,119 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:12:40,119 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 120 flow. Second operand 4 states and 355 transitions. [2023-11-17 15:12:40,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 210 flow [2023-11-17 15:12:40,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 183 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:40,121 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 111 flow [2023-11-17 15:12:40,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-11-17 15:12:40,121 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-11-17 15:12:40,122 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 111 flow [2023-11-17 15:12:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:12:40,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:40,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:12:40,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:12:40,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1657701509, now seen corresponding path program 1 times [2023-11-17 15:12:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216731293] [2023-11-17 15:12:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:40,513 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:12:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216731293] [2023-11-17 15:12:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216731293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:12:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767411148] [2023-11-17 15:12:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:40,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:12:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:40,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:12:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:12:40,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 183 [2023-11-17 15:12:40,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 111 flow. Second operand has 8 states, 8 states have (on average 73.125) internal successors, (585), 8 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:12:40,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:40,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 183 [2023-11-17 15:12:40,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:40,691 INFO L124 PetriNetUnfolderBase]: 36/100 cut-off events. [2023-11-17 15:12:40,691 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-17 15:12:40,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 100 events. 36/100 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 276 event pairs, 0 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 301. Up to 46 conditions per place. [2023-11-17 15:12:40,692 INFO L140 encePairwiseOnDemand]: 174/183 looper letters, 25 selfloop transitions, 18 changer transitions 10/53 dead transitions. [2023-11-17 15:12:40,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 337 flow [2023-11-17 15:12:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:12:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:12:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 828 transitions. [2023-11-17 15:12:40,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113263785394933 [2023-11-17 15:12:40,694 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 828 transitions. [2023-11-17 15:12:40,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 828 transitions. [2023-11-17 15:12:40,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:40,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 828 transitions. [2023-11-17 15:12:40,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 75.27272727272727) internal successors, (828), 11 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:40,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 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:12:40,700 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 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:12:40,700 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 111 flow. Second operand 11 states and 828 transitions. [2023-11-17 15:12:40,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 337 flow [2023-11-17 15:12:40,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 316 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:40,702 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 211 flow [2023-11-17 15:12:40,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=211, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-11-17 15:12:40,704 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2023-11-17 15:12:40,705 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 211 flow [2023-11-17 15:12:40,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.125) internal successors, (585), 8 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:12:40,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:40,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:40,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:12:40,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:12:40,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2001227893, now seen corresponding path program 2 times [2023-11-17 15:12:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:40,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37642200] [2023-11-17 15:12:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:41,053 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:12:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37642200] [2023-11-17 15:12:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37642200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:12:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294278013] [2023-11-17 15:12:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:41,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:12:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:12:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:12:41,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 183 [2023-11-17 15:12:41,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 78.125) internal successors, (625), 8 states have internal predecessors, (625), 0 states have call successors, (0), 0 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:12:41,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:41,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 183 [2023-11-17 15:12:41,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:41,254 INFO L124 PetriNetUnfolderBase]: 49/154 cut-off events. [2023-11-17 15:12:41,255 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-11-17 15:12:41,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 154 events. 49/154 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 603 event pairs, 10 based on Foata normal form. 2/156 useless extension candidates. Maximal degree in co-relation 568. Up to 56 conditions per place. [2023-11-17 15:12:41,255 INFO L140 encePairwiseOnDemand]: 177/183 looper letters, 20 selfloop transitions, 1 changer transitions 44/65 dead transitions. [2023-11-17 15:12:41,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 489 flow [2023-11-17 15:12:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:12:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:12:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 733 transitions. [2023-11-17 15:12:41,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44505160898603524 [2023-11-17 15:12:41,257 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 733 transitions. [2023-11-17 15:12:41,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 733 transitions. [2023-11-17 15:12:41,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:41,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 733 transitions. [2023-11-17 15:12:41,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.44444444444444) internal successors, (733), 9 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:41,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 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:12:41,261 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 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:12:41,261 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 211 flow. Second operand 9 states and 733 transitions. [2023-11-17 15:12:41,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 489 flow [2023-11-17 15:12:41,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 471 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-17 15:12:41,263 INFO L231 Difference]: Finished difference. Result has 54 places, 19 transitions, 101 flow [2023-11-17 15:12:41,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=101, PETRI_PLACES=54, PETRI_TRANSITIONS=19} [2023-11-17 15:12:41,264 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2023-11-17 15:12:41,264 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 19 transitions, 101 flow [2023-11-17 15:12:41,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.125) internal successors, (625), 8 states have internal predecessors, (625), 0 states have call successors, (0), 0 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:12:41,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:41,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:41,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:12:41,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:12:41,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1449091787, now seen corresponding path program 3 times [2023-11-17 15:12:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056070627] [2023-11-17 15:12:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:41,885 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:12:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056070627] [2023-11-17 15:12:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056070627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:12:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620988548] [2023-11-17 15:12:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:41,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:12:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:12:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:12:41,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 183 [2023-11-17 15:12:41,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 19 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 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:12:41,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:41,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 183 [2023-11-17 15:12:41,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:42,015 INFO L124 PetriNetUnfolderBase]: 8/41 cut-off events. [2023-11-17 15:12:42,015 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-17 15:12:42,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 41 events. 8/41 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 145. Up to 13 conditions per place. [2023-11-17 15:12:42,015 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 14 selfloop transitions, 4 changer transitions 12/31 dead transitions. [2023-11-17 15:12:42,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 31 transitions, 226 flow [2023-11-17 15:12:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:12:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:12:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 684 transitions. [2023-11-17 15:12:42,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41530054644808745 [2023-11-17 15:12:42,017 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 684 transitions. [2023-11-17 15:12:42,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 684 transitions. [2023-11-17 15:12:42,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:42,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 684 transitions. [2023-11-17 15:12:42,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.0) internal successors, (684), 9 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:12:42,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 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:12:42,020 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 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:12:42,021 INFO L175 Difference]: Start difference. First operand has 54 places, 19 transitions, 101 flow. Second operand 9 states and 684 transitions. [2023-11-17 15:12:42,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 31 transitions, 226 flow [2023-11-17 15:12:42,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 182 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-11-17 15:12:42,022 INFO L231 Difference]: Finished difference. Result has 43 places, 19 transitions, 90 flow [2023-11-17 15:12:42,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=19} [2023-11-17 15:12:42,022 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-11-17 15:12:42,022 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 19 transitions, 90 flow [2023-11-17 15:12:42,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 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:12:42,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:42,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:42,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:12:42,023 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:12:42,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash -248874927, now seen corresponding path program 4 times [2023-11-17 15:12:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:42,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934921853] [2023-11-17 15:12:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:12:42,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:12:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:12:42,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:12:42,084 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:12:42,084 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:12:42,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:12:42,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:12:42,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:12:42,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:12:42,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:12:42,087 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2023-11-17 15:12:42,090 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:12:42,090 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:12:42,111 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:12:42,112 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:12:42,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:42 BasicIcfg [2023-11-17 15:12:42,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:12:42,123 INFO L158 Benchmark]: Toolchain (without parser) took 9003.51ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 120.8MB in the beginning and 242.9MB in the end (delta: -122.2MB). Peak memory consumption was 84.9MB. Max. memory is 8.0GB. [2023-11-17 15:12:42,123 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:12:42,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.78ms. Allocated memory is still 172.0MB. Free memory was 120.8MB in the beginning and 97.0MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:42,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 172.0MB. Free memory was 97.0MB in the beginning and 94.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:42,124 INFO L158 Benchmark]: Boogie Preprocessor took 21.13ms. Allocated memory is still 172.0MB. Free memory was 94.2MB in the beginning and 92.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:12:42,124 INFO L158 Benchmark]: RCFGBuilder took 735.84ms. Allocated memory was 172.0MB in the beginning and 253.8MB in the end (delta: 81.8MB). Free memory was 92.5MB in the beginning and 195.8MB in the end (delta: -103.3MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2023-11-17 15:12:42,124 INFO L158 Benchmark]: TraceAbstraction took 7751.57ms. Allocated memory was 253.8MB in the beginning and 377.5MB in the end (delta: 123.7MB). Free memory was 195.3MB in the beginning and 242.9MB in the end (delta: -47.6MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. [2023-11-17 15:12:42,125 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 172.0MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.78ms. Allocated memory is still 172.0MB. Free memory was 120.8MB in the beginning and 97.0MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 172.0MB. Free memory was 97.0MB in the beginning and 94.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.13ms. Allocated memory is still 172.0MB. Free memory was 94.2MB in the beginning and 92.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 735.84ms. Allocated memory was 172.0MB in the beginning and 253.8MB in the end (delta: 81.8MB). Free memory was 92.5MB in the beginning and 195.8MB in the end (delta: -103.3MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7751.57ms. Allocated memory was 253.8MB in the beginning and 377.5MB in the end (delta: 123.7MB). Free memory was 195.3MB in the beginning and 242.9MB in the end (delta: -47.6MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 100 PlacesBefore, 26 PlacesAfterwards, 95 TransitionsBefore, 20 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 3074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1552, independent: 1416, independent conditional: 0, independent unconditional: 1416, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 974, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 974, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1552, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 974, unknown conditional: 0, unknown unconditional: 974] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 832]: 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: 834]: 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, 118 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: 7.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 817 IncrementalHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 8 mSDtfsCounter, 817 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:12:42,140 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...