/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/mix038.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:15:16,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:15:16,155 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:15:16,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:15:16,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:15:16,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:15:16,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:15:16,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:15:16,189 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:15:16,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:15:16,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:15:16,193 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:15:16,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:15:16,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:15:16,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:15:16,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:15:16,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:15:16,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:15:16,196 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:15:16,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:15:16,196 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:15:16,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:15:16,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:15:16,197 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:15:16,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:15:16,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:16,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:15:16,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:15:16,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:15:16,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:15:16,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:15:16,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:15:16,199 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:15:16,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:15:16,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:15:16,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:15:16,446 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:15:16,448 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:15:16,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-11-17 15:15:17,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:15:17,820 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:15:17,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-11-17 15:15:17,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c591b107/88c583fcc08d414e95c3300701c51d7e/FLAG74d0d9ac9 [2023-11-17 15:15:18,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c591b107/88c583fcc08d414e95c3300701c51d7e [2023-11-17 15:15:18,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:15:18,153 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:15:18,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:18,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:15:18,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:15:18,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725b04a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18, skipping insertion in model container [2023-11-17 15:15:18,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,208 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:15:18,386 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/mix038.opt.i[944,957] [2023-11-17 15:15:18,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:18,586 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:18,597 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/mix038.opt.i[944,957] [2023-11-17 15:15:18,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:18,690 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:18,691 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:18,697 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:18,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18 WrapperNode [2023-11-17 15:15:18,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:18,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:18,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:18,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:18,705 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:15:18" (1/1) ... [2023-11-17 15:15:18,737 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:15:18" (1/1) ... [2023-11-17 15:15:18,774 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-11-17 15:15:18,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:18,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:18,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:18,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:18,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:18,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:18,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:18,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:18,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (1/1) ... [2023-11-17 15:15:18,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:18,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:18,858 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:15:18,861 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:15:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:18,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:18,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:15:18,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:15:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:18,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:18,889 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:15:19,049 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:19,051 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:19,286 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:19,423 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:19,423 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:19,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:19 BoogieIcfgContainer [2023-11-17 15:15:19,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:19,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:19,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:19,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:19,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:15:18" (1/3) ... [2023-11-17 15:15:19,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2220b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:19, skipping insertion in model container [2023-11-17 15:15:19,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:18" (2/3) ... [2023-11-17 15:15:19,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2220b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:19, skipping insertion in model container [2023-11-17 15:15:19,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:19" (3/3) ... [2023-11-17 15:15:19,432 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-11-17 15:15:19,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:19,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:19,446 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:19,517 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:19,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 242 flow [2023-11-17 15:15:19,600 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-17 15:15:19,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:19,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-17 15:15:19,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 242 flow [2023-11-17 15:15:19,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-11-17 15:15:19,618 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:19,628 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-17 15:15:19,630 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-17 15:15:19,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-11-17 15:15:19,666 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-17 15:15:19,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:19,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-17 15:15:19,672 INFO L119 LiptonReduction]: Number of co-enabled transitions 2256 [2023-11-17 15:15:23,550 INFO L134 LiptonReduction]: Checked pairs total: 4177 [2023-11-17 15:15:23,550 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-11-17 15:15:23,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:23,569 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;@3547d9db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:23,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:15:23,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:23,573 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 15:15:23,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:23,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:23,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:23,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:23,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash -278073125, now seen corresponding path program 1 times [2023-11-17 15:15:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025952087] [2023-11-17 15:15:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:24,013 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:15:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025952087] [2023-11-17 15:15:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025952087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135303728] [2023-11-17 15:15:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:24,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:24,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 218 [2023-11-17 15:15:24,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:15:24,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:24,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 218 [2023-11-17 15:15:24,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:24,289 INFO L124 PetriNetUnfolderBase]: 511/903 cut-off events. [2023-11-17 15:15:24,290 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 15:15:24,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 903 events. 511/903 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4510 event pairs, 112 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1711. Up to 580 conditions per place. [2023-11-17 15:15:24,301 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-11-17 15:15:24,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-11-17 15:15:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-11-17 15:15:24,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518348623853211 [2023-11-17 15:15:24,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-11-17 15:15:24,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-11-17 15:15:24,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-11-17 15:15:24,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:15:24,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:15:24,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:15:24,328 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 339 transitions. [2023-11-17 15:15:24,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-11-17 15:15:24,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:24,332 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-17 15:15:24,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-17 15:15:24,338 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-17 15:15:24,338 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-17 15:15:24,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:15:24,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:24,340 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:24,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -940259005, now seen corresponding path program 1 times [2023-11-17 15:15:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493211477] [2023-11-17 15:15:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:24,578 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:15:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493211477] [2023-11-17 15:15:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493211477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006820434] [2023-11-17 15:15:24,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:24,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:24,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:24,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:24,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2023-11-17 15:15:24,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:15:24,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:24,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2023-11-17 15:15:24,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:24,805 INFO L124 PetriNetUnfolderBase]: 1119/1724 cut-off events. [2023-11-17 15:15:24,806 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-17 15:15:24,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1724 events. 1119/1724 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7728 event pairs, 363 based on Foata normal form. 52/1776 useless extension candidates. Maximal degree in co-relation 3580. Up to 1221 conditions per place. [2023-11-17 15:15:24,815 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-11-17 15:15:24,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2023-11-17 15:15:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-11-17 15:15:24,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908256880733945 [2023-11-17 15:15:24,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-11-17 15:15:24,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-11-17 15:15:24,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-11-17 15:15:24,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:15:24,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:15:24,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:15:24,828 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 321 transitions. [2023-11-17 15:15:24,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2023-11-17 15:15:24,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:24,831 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2023-11-17 15:15:24,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-11-17 15:15:24,832 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-17 15:15:24,832 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2023-11-17 15:15:24,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:15:24,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:24,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:24,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash 916740781, now seen corresponding path program 1 times [2023-11-17 15:15:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567334352] [2023-11-17 15:15:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567334352] [2023-11-17 15:15:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567334352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979860763] [2023-11-17 15:15:25,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:25,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:25,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2023-11-17 15:15:25,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 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:15:25,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2023-11-17 15:15:25,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:25,238 INFO L124 PetriNetUnfolderBase]: 1047/1616 cut-off events. [2023-11-17 15:15:25,238 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2023-11-17 15:15:25,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1616 events. 1047/1616 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6905 event pairs, 309 based on Foata normal form. 24/1640 useless extension candidates. Maximal degree in co-relation 4138. Up to 867 conditions per place. [2023-11-17 15:15:25,249 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 33 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2023-11-17 15:15:25,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 216 flow [2023-11-17 15:15:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-11-17 15:15:25,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793577981651376 [2023-11-17 15:15:25,254 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-11-17 15:15:25,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-11-17 15:15:25,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:25,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-11-17 15:15:25,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:15:25,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:25,258 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:25,258 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 418 transitions. [2023-11-17 15:15:25,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 216 flow [2023-11-17 15:15:25,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:25,265 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2023-11-17 15:15:25,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-11-17 15:15:25,267 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-17 15:15:25,267 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2023-11-17 15:15:25,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 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:15:25,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:25,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:25,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:25,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:25,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1655423329, now seen corresponding path program 1 times [2023-11-17 15:15:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303243681] [2023-11-17 15:15:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,414 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:15:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303243681] [2023-11-17 15:15:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303243681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951999453] [2023-11-17 15:15:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:25,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2023-11-17 15:15:25,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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:15:25,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2023-11-17 15:15:25,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:25,663 INFO L124 PetriNetUnfolderBase]: 1015/1568 cut-off events. [2023-11-17 15:15:25,663 INFO L125 PetriNetUnfolderBase]: For 1093/1093 co-relation queries the response was YES. [2023-11-17 15:15:25,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1568 events. 1015/1568 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6978 event pairs, 211 based on Foata normal form. 8/1576 useless extension candidates. Maximal degree in co-relation 4300. Up to 1047 conditions per place. [2023-11-17 15:15:25,675 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2023-11-17 15:15:25,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 306 flow [2023-11-17 15:15:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-11-17 15:15:25,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908256880733945 [2023-11-17 15:15:25,678 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-11-17 15:15:25,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-11-17 15:15:25,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:25,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-11-17 15:15:25,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:15:25,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:25,681 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:25,682 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 128 flow. Second operand 4 states and 428 transitions. [2023-11-17 15:15:25,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 306 flow [2023-11-17 15:15:25,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:25,685 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 197 flow [2023-11-17 15:15:25,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-11-17 15:15:25,687 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-11-17 15:15:25,687 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 197 flow [2023-11-17 15:15:25,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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:15:25,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:25,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:25,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:25,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:25,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 221527857, now seen corresponding path program 1 times [2023-11-17 15:15:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889000759] [2023-11-17 15:15:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,851 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:15:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889000759] [2023-11-17 15:15:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889000759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151207872] [2023-11-17 15:15:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:25,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-17 15:15:25,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:15:25,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-17 15:15:25,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,030 INFO L124 PetriNetUnfolderBase]: 634/1079 cut-off events. [2023-11-17 15:15:26,031 INFO L125 PetriNetUnfolderBase]: For 1315/1367 co-relation queries the response was YES. [2023-11-17 15:15:26,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1079 events. 634/1079 cut-off events. For 1315/1367 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5502 event pairs, 127 based on Foata normal form. 128/1171 useless extension candidates. Maximal degree in co-relation 3107. Up to 640 conditions per place. [2023-11-17 15:15:26,037 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 45 selfloop transitions, 7 changer transitions 16/77 dead transitions. [2023-11-17 15:15:26,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 563 flow [2023-11-17 15:15:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-11-17 15:15:26,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48440366972477067 [2023-11-17 15:15:26,039 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-11-17 15:15:26,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-11-17 15:15:26,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-11-17 15:15:26,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 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:15:26,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:15:26,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:15:26,044 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 197 flow. Second operand 5 states and 528 transitions. [2023-11-17 15:15:26,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 77 transitions, 563 flow [2023-11-17 15:15:26,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 559 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-17 15:15:26,048 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 249 flow [2023-11-17 15:15:26,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-17 15:15:26,049 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 15:15:26,049 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 249 flow [2023-11-17 15:15:26,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:15:26,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:26,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:26,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:26,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:26,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1083815616, now seen corresponding path program 1 times [2023-11-17 15:15:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11707316] [2023-11-17 15:15:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:26,180 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:15:26,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11707316] [2023-11-17 15:15:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11707316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827913543] [2023-11-17 15:15:26,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:26,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:26,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:26,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:26,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-17 15:15:26,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:15:26,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:26,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-17 15:15:26,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,378 INFO L124 PetriNetUnfolderBase]: 463/840 cut-off events. [2023-11-17 15:15:26,378 INFO L125 PetriNetUnfolderBase]: For 1401/1512 co-relation queries the response was YES. [2023-11-17 15:15:26,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 840 events. 463/840 cut-off events. For 1401/1512 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4299 event pairs, 57 based on Foata normal form. 118/935 useless extension candidates. Maximal degree in co-relation 3033. Up to 290 conditions per place. [2023-11-17 15:15:26,383 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 55 selfloop transitions, 13 changer transitions 22/99 dead transitions. [2023-11-17 15:15:26,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 777 flow [2023-11-17 15:15:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 738 transitions. [2023-11-17 15:15:26,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4836173001310616 [2023-11-17 15:15:26,386 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 738 transitions. [2023-11-17 15:15:26,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 738 transitions. [2023-11-17 15:15:26,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 738 transitions. [2023-11-17 15:15:26,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.42857142857143) internal successors, (738), 7 states have internal predecessors, (738), 0 states have call successors, (0), 0 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:15:26,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:15:26,392 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:15:26,392 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 249 flow. Second operand 7 states and 738 transitions. [2023-11-17 15:15:26,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 777 flow [2023-11-17 15:15:26,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 99 transitions, 773 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:26,397 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 333 flow [2023-11-17 15:15:26,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-17 15:15:26,398 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-17 15:15:26,398 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 333 flow [2023-11-17 15:15:26,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:15:26,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:26,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:26,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:26,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:26,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1843260920, now seen corresponding path program 1 times [2023-11-17 15:15:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648271072] [2023-11-17 15:15:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:26,551 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:15:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648271072] [2023-11-17 15:15:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648271072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207400676] [2023-11-17 15:15:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:26,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 218 [2023-11-17 15:15:26,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 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:15:26,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:26,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 218 [2023-11-17 15:15:26,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,803 INFO L124 PetriNetUnfolderBase]: 682/1218 cut-off events. [2023-11-17 15:15:26,804 INFO L125 PetriNetUnfolderBase]: For 4164/4164 co-relation queries the response was YES. [2023-11-17 15:15:26,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5406 conditions, 1218 events. 682/1218 cut-off events. For 4164/4164 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6191 event pairs, 96 based on Foata normal form. 8/1226 useless extension candidates. Maximal degree in co-relation 5379. Up to 555 conditions per place. [2023-11-17 15:15:26,810 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 61 selfloop transitions, 19 changer transitions 18/98 dead transitions. [2023-11-17 15:15:26,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 886 flow [2023-11-17 15:15:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-11-17 15:15:26,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47889908256880737 [2023-11-17 15:15:26,813 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-11-17 15:15:26,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-11-17 15:15:26,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-11-17 15:15:26,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 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:15:26,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:15:26,817 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:15:26,817 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 333 flow. Second operand 5 states and 522 transitions. [2023-11-17 15:15:26,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 886 flow [2023-11-17 15:15:26,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 806 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:26,838 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 407 flow [2023-11-17 15:15:26,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-11-17 15:15:26,838 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-11-17 15:15:26,839 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 407 flow [2023-11-17 15:15:26,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 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:15:26,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:26,839 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:15:26,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:26,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:26,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1159089599, now seen corresponding path program 1 times [2023-11-17 15:15:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447069476] [2023-11-17 15:15:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:26,999 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:15:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447069476] [2023-11-17 15:15:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447069476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:27,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:27,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:27,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681758539] [2023-11-17 15:15:27,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:27,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:27,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-17 15:15:27,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:27,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:27,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-17 15:15:27,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:27,142 INFO L124 PetriNetUnfolderBase]: 238/466 cut-off events. [2023-11-17 15:15:27,142 INFO L125 PetriNetUnfolderBase]: For 1624/1661 co-relation queries the response was YES. [2023-11-17 15:15:27,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 466 events. 238/466 cut-off events. For 1624/1661 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2078 event pairs, 33 based on Foata normal form. 42/498 useless extension candidates. Maximal degree in co-relation 1999. Up to 163 conditions per place. [2023-11-17 15:15:27,145 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 45 selfloop transitions, 10 changer transitions 18/86 dead transitions. [2023-11-17 15:15:27,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 846 flow [2023-11-17 15:15:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2023-11-17 15:15:27,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47313237221494103 [2023-11-17 15:15:27,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2023-11-17 15:15:27,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2023-11-17 15:15:27,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:27,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2023-11-17 15:15:27,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 0 states have call successors, (0), 0 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:15:27,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:15:27,153 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:15:27,153 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 407 flow. Second operand 7 states and 722 transitions. [2023-11-17 15:15:27,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 846 flow [2023-11-17 15:15:27,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 813 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:27,158 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 401 flow [2023-11-17 15:15:27,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-11-17 15:15:27,159 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2023-11-17 15:15:27,159 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 401 flow [2023-11-17 15:15:27,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:27,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:27,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:27,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:27,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1108275004, now seen corresponding path program 1 times [2023-11-17 15:15:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394903540] [2023-11-17 15:15:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:27,306 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:15:27,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:27,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394903540] [2023-11-17 15:15:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394903540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:27,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239974709] [2023-11-17 15:15:27,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:27,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:27,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:27,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:27,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2023-11-17 15:15:27,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 401 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:15:27,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:27,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2023-11-17 15:15:27,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:27,435 INFO L124 PetriNetUnfolderBase]: 261/531 cut-off events. [2023-11-17 15:15:27,435 INFO L125 PetriNetUnfolderBase]: For 2053/2066 co-relation queries the response was YES. [2023-11-17 15:15:27,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 531 events. 261/531 cut-off events. For 2053/2066 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2497 event pairs, 51 based on Foata normal form. 5/525 useless extension candidates. Maximal degree in co-relation 2515. Up to 252 conditions per place. [2023-11-17 15:15:27,438 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 29 selfloop transitions, 1 changer transitions 39/73 dead transitions. [2023-11-17 15:15:27,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 719 flow [2023-11-17 15:15:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-11-17 15:15:27,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49770642201834864 [2023-11-17 15:15:27,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-11-17 15:15:27,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-11-17 15:15:27,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:27,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-11-17 15:15:27,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 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:15:27,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:27,443 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:27,443 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 401 flow. Second operand 4 states and 434 transitions. [2023-11-17 15:15:27,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 719 flow [2023-11-17 15:15:27,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 642 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-11-17 15:15:27,450 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 211 flow [2023-11-17 15:15:27,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2023-11-17 15:15:27,451 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-17 15:15:27,451 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 211 flow [2023-11-17 15:15:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:15:27,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:27,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:27,452 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:27,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1481211226, now seen corresponding path program 2 times [2023-11-17 15:15:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263644622] [2023-11-17 15:15:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:27,691 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:15:27,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:27,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263644622] [2023-11-17 15:15:27,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263644622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:27,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:27,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:27,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004287129] [2023-11-17 15:15:27,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:27,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:27,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2023-11-17 15:15:27,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 31 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:27,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:27,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2023-11-17 15:15:27,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:27,774 INFO L124 PetriNetUnfolderBase]: 125/267 cut-off events. [2023-11-17 15:15:27,774 INFO L125 PetriNetUnfolderBase]: For 949/949 co-relation queries the response was YES. [2023-11-17 15:15:27,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 267 events. 125/267 cut-off events. For 949/949 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1009 event pairs, 46 based on Foata normal form. 1/268 useless extension candidates. Maximal degree in co-relation 1146. Up to 169 conditions per place. [2023-11-17 15:15:27,776 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 27 selfloop transitions, 4 changer transitions 15/46 dead transitions. [2023-11-17 15:15:27,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 371 flow [2023-11-17 15:15:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-11-17 15:15:27,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47477064220183485 [2023-11-17 15:15:27,778 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-11-17 15:15:27,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-11-17 15:15:27,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:27,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-11-17 15:15:27,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:15:27,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:27,781 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:15:27,781 INFO L175 Difference]: Start difference. First operand has 54 places, 31 transitions, 211 flow. Second operand 4 states and 414 transitions. [2023-11-17 15:15:27,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 371 flow [2023-11-17 15:15:27,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 319 flow, removed 4 selfloop flow, removed 11 redundant places. [2023-11-17 15:15:27,784 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 139 flow [2023-11-17 15:15:27,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-11-17 15:15:27,785 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 15:15:27,785 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 139 flow [2023-11-17 15:15:27,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:27,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:27,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:27,786 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:15:27,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1165237284, now seen corresponding path program 3 times [2023-11-17 15:15:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926470049] [2023-11-17 15:15:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:27,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:27,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:27,883 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:27,884 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:15:27,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:15:27,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:15:27,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:15:27,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:15:27,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:15:27,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:15:27,887 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,891 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:27,891 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:27,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:27,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:27,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:27,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:27 BasicIcfg [2023-11-17 15:15:27,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:27,952 INFO L158 Benchmark]: Toolchain (without parser) took 9798.89ms. Allocated memory was 304.1MB in the beginning and 438.3MB in the end (delta: 134.2MB). Free memory was 255.3MB in the beginning and 283.7MB in the end (delta: -28.4MB). Peak memory consumption was 108.4MB. Max. memory is 8.0GB. [2023-11-17 15:15:27,952 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:27,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.02ms. Allocated memory is still 304.1MB. Free memory was 254.7MB in the beginning and 232.2MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:27,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.80ms. Allocated memory is still 304.1MB. Free memory was 232.2MB in the beginning and 229.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:27,953 INFO L158 Benchmark]: Boogie Preprocessor took 52.06ms. Allocated memory is still 304.1MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:27,953 INFO L158 Benchmark]: RCFGBuilder took 597.40ms. Allocated memory is still 304.1MB. Free memory was 228.0MB in the beginning and 196.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-11-17 15:15:27,953 INFO L158 Benchmark]: TraceAbstraction took 8524.32ms. Allocated memory was 304.1MB in the beginning and 438.3MB in the end (delta: 134.2MB). Free memory was 195.5MB in the beginning and 283.7MB in the end (delta: -88.2MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. [2023-11-17 15:15:27,955 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.14ms. Allocated memory is still 183.5MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.02ms. Allocated memory is still 304.1MB. Free memory was 254.7MB in the beginning and 232.2MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.80ms. Allocated memory is still 304.1MB. Free memory was 232.2MB in the beginning and 229.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.06ms. Allocated memory is still 304.1MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 597.40ms. Allocated memory is still 304.1MB. Free memory was 228.0MB in the beginning and 196.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8524.32ms. Allocated memory was 304.1MB in the beginning and 438.3MB in the end (delta: 134.2MB). Free memory was 195.5MB in the beginning and 283.7MB in the end (delta: -88.2MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation 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: 3.9s, 120 PlacesBefore, 32 PlacesAfterwards, 112 TransitionsBefore, 23 TransitionsAfterwards, 2256 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 4177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2492, independent: 2371, independent conditional: 0, independent unconditional: 2371, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1620, independent conditional: 0, independent unconditional: 1620, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1612, independent conditional: 0, independent unconditional: 1612, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 292, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2492, independent: 751, independent conditional: 0, independent unconditional: 751, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 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_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 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 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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 7 procedures, 144 locations, 6 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: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 19 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 565 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:15:27,981 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...