/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/mix007.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:17,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:17,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:12:17,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:17,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:17,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:17,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:17,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:17,677 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:17,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:17,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:17,678 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:17,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:17,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:17,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:17,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:17,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:17,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:17,680 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:17,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:17,680 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:17,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:17,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:17,681 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:17,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:17,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:17,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:17,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:17,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:17,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:17,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:17,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:17,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:12:17,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:17,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:17,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:17,849 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:17,850 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:17,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2023-11-17 15:12:18,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:19,122 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:19,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2023-11-17 15:12:19,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1431038/86530221e5814e838a3f40b52648f4bb/FLAG39e2ff475 [2023-11-17 15:12:19,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1431038/86530221e5814e838a3f40b52648f4bb [2023-11-17 15:12:19,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:19,157 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:19,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:19,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:19,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:19,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c0fadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19, skipping insertion in model container [2023-11-17 15:12:19,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,203 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:19,330 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/mix007.opt.i[944,957] [2023-11-17 15:12:19,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:19,507 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:19,516 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/mix007.opt.i[944,957] [2023-11-17 15:12:19,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:19,584 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:19,585 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:19,590 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:19,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19 WrapperNode [2023-11-17 15:12:19,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:19,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:19,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:19,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:19,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,624 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-11-17 15:12:19,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:19,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:19,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:19,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:19,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:19,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:19,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:19,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:19,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (1/1) ... [2023-11-17 15:12:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:19,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:12:19,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:19,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:19,709 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:19,710 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:12:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:12:19,710 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:12:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:12:19,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:19,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:19,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:19,711 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:12:19,858 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:19,859 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:12:20,158 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:12:20,284 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:12:20,284 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:12:20,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:20 BoogieIcfgContainer [2023-11-17 15:12:20,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:12:20,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:12:20,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:12:20,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:12:20,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:19" (1/3) ... [2023-11-17 15:12:20,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9518fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:20, skipping insertion in model container [2023-11-17 15:12:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:19" (2/3) ... [2023-11-17 15:12:20,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9518fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:20, skipping insertion in model container [2023-11-17 15:12:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:20" (3/3) ... [2023-11-17 15:12:20,292 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2023-11-17 15:12:20,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:12:20,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:12:20,305 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:12:20,357 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:12:20,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 288 flow [2023-11-17 15:12:20,448 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-17 15:12:20,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:12:20,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 288 flow [2023-11-17 15:12:20,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2023-11-17 15:12:20,462 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:12:20,474 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-17 15:12:20,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-17 15:12:20,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2023-11-17 15:12:20,520 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-17 15:12:20,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:20,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:12:20,523 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490 [2023-11-17 15:12:24,257 INFO L134 LiptonReduction]: Checked pairs total: 7700 [2023-11-17 15:12:24,258 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-11-17 15:12:24,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:12:24,272 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;@4b210d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:12:24,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:12:24,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:12:24,275 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-17 15:12:24,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:24,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:24,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:24,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:24,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash -308982097, now seen corresponding path program 1 times [2023-11-17 15:12:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801907197] [2023-11-17 15:12:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801907197] [2023-11-17 15:12:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801907197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:24,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:24,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868139128] [2023-11-17 15:12:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:24,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:24,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 254 [2023-11-17 15:12:24,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:24,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:24,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 254 [2023-11-17 15:12:24,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:25,096 INFO L124 PetriNetUnfolderBase]: 2594/3785 cut-off events. [2023-11-17 15:12:25,097 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-17 15:12:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7480 conditions, 3785 events. 2594/3785 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19939 event pairs, 518 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7468. Up to 2797 conditions per place. [2023-11-17 15:12:25,118 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-17 15:12:25,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-11-17 15:12:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-11-17 15:12:25,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288713910761155 [2023-11-17 15:12:25,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-11-17 15:12:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-11-17 15:12:25,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:25,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-11-17 15:12:25,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,147 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 403 transitions. [2023-11-17 15:12:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-11-17 15:12:25,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:25,153 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-11-17 15:12:25,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-17 15:12:25,159 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-17 15:12:25,159 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-11-17 15:12:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:25,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:12:25,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:25,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -578999884, now seen corresponding path program 1 times [2023-11-17 15:12:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587070256] [2023-11-17 15:12:25,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587070256] [2023-11-17 15:12:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587070256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:25,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650119505] [2023-11-17 15:12:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:25,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:25,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2023-11-17 15:12:25,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:25,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2023-11-17 15:12:25,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:25,753 INFO L124 PetriNetUnfolderBase]: 3521/4862 cut-off events. [2023-11-17 15:12:25,753 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-11-17 15:12:25,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10094 conditions, 4862 events. 3521/4862 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22764 event pairs, 1047 based on Foata normal form. 30/4882 useless extension candidates. Maximal degree in co-relation 10084. Up to 4542 conditions per place. [2023-11-17 15:12:25,779 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 36 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-11-17 15:12:25,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 178 flow [2023-11-17 15:12:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-17 15:12:25,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170603674540682 [2023-11-17 15:12:25,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-17 15:12:25,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-17 15:12:25,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:25,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-17 15:12:25,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,784 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 394 transitions. [2023-11-17 15:12:25,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 178 flow [2023-11-17 15:12:25,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:25,787 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 79 flow [2023-11-17 15:12:25,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-17 15:12:25,788 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-17 15:12:25,788 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2023-11-17 15:12:25,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:25,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:25,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:12:25,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:25,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash -769128569, now seen corresponding path program 1 times [2023-11-17 15:12:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113825188] [2023-11-17 15:12:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113825188] [2023-11-17 15:12:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113825188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:25,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680344802] [2023-11-17 15:12:25,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:25,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:25,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2023-11-17 15:12:25,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:25,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:25,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2023-11-17 15:12:25,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:26,561 INFO L124 PetriNetUnfolderBase]: 6707/9260 cut-off events. [2023-11-17 15:12:26,561 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2023-11-17 15:12:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20111 conditions, 9260 events. 6707/9260 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 44855 event pairs, 1735 based on Foata normal form. 288/9548 useless extension candidates. Maximal degree in co-relation 20100. Up to 5189 conditions per place. [2023-11-17 15:12:26,605 INFO L140 encePairwiseOnDemand]: 246/254 looper letters, 51 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-11-17 15:12:26,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 261 flow [2023-11-17 15:12:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-11-17 15:12:26,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940944881889764 [2023-11-17 15:12:26,607 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-11-17 15:12:26,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-11-17 15:12:26,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:26,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-11-17 15:12:26,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:26,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:26,610 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:26,610 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 79 flow. Second operand 4 states and 502 transitions. [2023-11-17 15:12:26,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 261 flow [2023-11-17 15:12:26,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:26,611 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 130 flow [2023-11-17 15:12:26,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-17 15:12:26,612 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-11-17 15:12:26,612 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 130 flow [2023-11-17 15:12:26,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:26,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:26,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:26,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:12:26,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:26,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -469228139, now seen corresponding path program 1 times [2023-11-17 15:12:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485465247] [2023-11-17 15:12:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485465247] [2023-11-17 15:12:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485465247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:26,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746883375] [2023-11-17 15:12:26,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:26,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:26,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:26,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2023-11-17 15:12:26,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:26,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2023-11-17 15:12:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:27,381 INFO L124 PetriNetUnfolderBase]: 6823/9424 cut-off events. [2023-11-17 15:12:27,381 INFO L125 PetriNetUnfolderBase]: For 5669/5669 co-relation queries the response was YES. [2023-11-17 15:12:27,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24517 conditions, 9424 events. 6823/9424 cut-off events. For 5669/5669 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 43870 event pairs, 1999 based on Foata normal form. 96/9520 useless extension candidates. Maximal degree in co-relation 24502. Up to 4953 conditions per place. [2023-11-17 15:12:27,427 INFO L140 encePairwiseOnDemand]: 245/254 looper letters, 49 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2023-11-17 15:12:27,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 354 flow [2023-11-17 15:12:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-11-17 15:12:27,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4881889763779528 [2023-11-17 15:12:27,429 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-11-17 15:12:27,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-11-17 15:12:27,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:27,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-11-17 15:12:27,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:27,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:27,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:27,432 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 130 flow. Second operand 4 states and 496 transitions. [2023-11-17 15:12:27,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 354 flow [2023-11-17 15:12:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:27,440 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 247 flow [2023-11-17 15:12:27,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-11-17 15:12:27,441 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-17 15:12:27,441 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 247 flow [2023-11-17 15:12:27,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:27,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:27,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:12:27,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:27,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -561932236, now seen corresponding path program 1 times [2023-11-17 15:12:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878207963] [2023-11-17 15:12:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878207963] [2023-11-17 15:12:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878207963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768574501] [2023-11-17 15:12:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:27,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:27,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:27,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-17 15:12:27,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:27,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:27,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-17 15:12:27,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:28,192 INFO L124 PetriNetUnfolderBase]: 4270/6414 cut-off events. [2023-11-17 15:12:28,193 INFO L125 PetriNetUnfolderBase]: For 7047/7487 co-relation queries the response was YES. [2023-11-17 15:12:28,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17344 conditions, 6414 events. 4270/6414 cut-off events. For 7047/7487 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 38383 event pairs, 869 based on Foata normal form. 531/6655 useless extension candidates. Maximal degree in co-relation 17325. Up to 4219 conditions per place. [2023-11-17 15:12:28,224 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 72 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2023-11-17 15:12:28,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 97 transitions, 653 flow [2023-11-17 15:12:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-11-17 15:12:28,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49133858267716535 [2023-11-17 15:12:28,226 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-11-17 15:12:28,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-11-17 15:12:28,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:28,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-11-17 15:12:28,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:28,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:28,229 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:28,229 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 247 flow. Second operand 5 states and 624 transitions. [2023-11-17 15:12:28,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 97 transitions, 653 flow [2023-11-17 15:12:28,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 636 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:28,235 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 317 flow [2023-11-17 15:12:28,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-11-17 15:12:28,236 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-11-17 15:12:28,236 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 317 flow [2023-11-17 15:12:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:28,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:28,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:28,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:12:28,236 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:28,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1013887120, now seen corresponding path program 1 times [2023-11-17 15:12:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863420870] [2023-11-17 15:12:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:28,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863420870] [2023-11-17 15:12:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863420870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:28,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045347365] [2023-11-17 15:12:28,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:28,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:28,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:28,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:28,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2023-11-17 15:12:28,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:28,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:28,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2023-11-17 15:12:28,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:29,176 INFO L124 PetriNetUnfolderBase]: 5941/9023 cut-off events. [2023-11-17 15:12:29,176 INFO L125 PetriNetUnfolderBase]: For 15746/16510 co-relation queries the response was YES. [2023-11-17 15:12:29,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32838 conditions, 9023 events. 5941/9023 cut-off events. For 15746/16510 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 58497 event pairs, 1310 based on Foata normal form. 198/8807 useless extension candidates. Maximal degree in co-relation 32815. Up to 4387 conditions per place. [2023-11-17 15:12:29,241 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 70 selfloop transitions, 3 changer transitions 21/106 dead transitions. [2023-11-17 15:12:29,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 106 transitions, 802 flow [2023-11-17 15:12:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-11-17 15:12:29,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167322834645669 [2023-11-17 15:12:29,243 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-11-17 15:12:29,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-11-17 15:12:29,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:29,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-11-17 15:12:29,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:29,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:29,246 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:29,246 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 317 flow. Second operand 4 states and 525 transitions. [2023-11-17 15:12:29,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 106 transitions, 802 flow [2023-11-17 15:12:29,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:29,261 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 329 flow [2023-11-17 15:12:29,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-17 15:12:29,262 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-11-17 15:12:29,262 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 329 flow [2023-11-17 15:12:29,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:29,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:29,263 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:12:29,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:12:29,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:29,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1582265507, now seen corresponding path program 1 times [2023-11-17 15:12:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309601055] [2023-11-17 15:12:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:29,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:29,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309601055] [2023-11-17 15:12:29,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309601055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:29,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:29,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588645719] [2023-11-17 15:12:29,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:29,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:29,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:29,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:29,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2023-11-17 15:12:29,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:29,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:29,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2023-11-17 15:12:29,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:30,425 INFO L124 PetriNetUnfolderBase]: 9348/13688 cut-off events. [2023-11-17 15:12:30,425 INFO L125 PetriNetUnfolderBase]: For 29031/29031 co-relation queries the response was YES. [2023-11-17 15:12:30,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52486 conditions, 13688 events. 9348/13688 cut-off events. For 29031/29031 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 78711 event pairs, 2714 based on Foata normal form. 78/13766 useless extension candidates. Maximal degree in co-relation 52461. Up to 6874 conditions per place. [2023-11-17 15:12:30,481 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 65 selfloop transitions, 10 changer transitions 14/89 dead transitions. [2023-11-17 15:12:30,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 688 flow [2023-11-17 15:12:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-11-17 15:12:30,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49606299212598426 [2023-11-17 15:12:30,483 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-11-17 15:12:30,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-11-17 15:12:30,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:30,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-11-17 15:12:30,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:30,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:30,485 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:30,485 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 329 flow. Second operand 4 states and 504 transitions. [2023-11-17 15:12:30,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 688 flow [2023-11-17 15:12:30,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:30,522 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 316 flow [2023-11-17 15:12:30,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-11-17 15:12:30,523 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-11-17 15:12:30,523 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 316 flow [2023-11-17 15:12:30,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:30,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:30,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:30,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:12:30,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:30,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1116496720, now seen corresponding path program 1 times [2023-11-17 15:12:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308759198] [2023-11-17 15:12:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308759198] [2023-11-17 15:12:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308759198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:30,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319865763] [2023-11-17 15:12:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:30,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:30,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-17 15:12:30,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:30,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:30,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-17 15:12:30,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:31,226 INFO L124 PetriNetUnfolderBase]: 3461/5570 cut-off events. [2023-11-17 15:12:31,226 INFO L125 PetriNetUnfolderBase]: For 8787/9124 co-relation queries the response was YES. [2023-11-17 15:12:31,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20206 conditions, 5570 events. 3461/5570 cut-off events. For 8787/9124 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 36129 event pairs, 445 based on Foata normal form. 627/6020 useless extension candidates. Maximal degree in co-relation 20178. Up to 2614 conditions per place. [2023-11-17 15:12:31,252 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 79 selfloop transitions, 14 changer transitions 1/108 dead transitions. [2023-11-17 15:12:31,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 838 flow [2023-11-17 15:12:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:12:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:12:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-11-17 15:12:31,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927821522309711 [2023-11-17 15:12:31,255 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-11-17 15:12:31,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-11-17 15:12:31,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:31,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-11-17 15:12:31,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:31,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:31,258 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:31,258 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 316 flow. Second operand 6 states and 751 transitions. [2023-11-17 15:12:31,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 838 flow [2023-11-17 15:12:31,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 807 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:31,288 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 417 flow [2023-11-17 15:12:31,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-17 15:12:31,289 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-11-17 15:12:31,289 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 417 flow [2023-11-17 15:12:31,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:31,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:31,289 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:12:31,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:12:31,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:31,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1049752920, now seen corresponding path program 1 times [2023-11-17 15:12:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:31,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979888726] [2023-11-17 15:12:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:31,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:31,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979888726] [2023-11-17 15:12:31,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979888726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:31,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:31,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:31,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064590063] [2023-11-17 15:12:31,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:31,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:12:31,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:31,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:12:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:12:31,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-17 15:12:31,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:31,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:31,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-17 15:12:31,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:32,001 INFO L124 PetriNetUnfolderBase]: 2981/4860 cut-off events. [2023-11-17 15:12:32,001 INFO L125 PetriNetUnfolderBase]: For 10166/10655 co-relation queries the response was YES. [2023-11-17 15:12:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21377 conditions, 4860 events. 2981/4860 cut-off events. For 10166/10655 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 31654 event pairs, 276 based on Foata normal form. 413/5113 useless extension candidates. Maximal degree in co-relation 21346. Up to 2394 conditions per place. [2023-11-17 15:12:32,022 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 80 selfloop transitions, 22 changer transitions 23/137 dead transitions. [2023-11-17 15:12:32,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 1137 flow [2023-11-17 15:12:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:12:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:12:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-11-17 15:12:32,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921259842519685 [2023-11-17 15:12:32,025 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-11-17 15:12:32,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-11-17 15:12:32,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:32,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-11-17 15:12:32,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 254.0) internal successors, (2286), 9 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,030 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 254.0) internal successors, (2286), 9 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,030 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 417 flow. Second operand 8 states and 1000 transitions. [2023-11-17 15:12:32,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 1137 flow [2023-11-17 15:12:32,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 137 transitions, 1093 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:32,181 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 496 flow [2023-11-17 15:12:32,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=496, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2023-11-17 15:12:32,181 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-11-17 15:12:32,182 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 496 flow [2023-11-17 15:12:32,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:32,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:32,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:12:32,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:32,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1075625971, now seen corresponding path program 1 times [2023-11-17 15:12:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43807268] [2023-11-17 15:12:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:32,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43807268] [2023-11-17 15:12:32,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43807268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:32,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:12:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127263443] [2023-11-17 15:12:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:32,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:12:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:12:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:12:32,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-17 15:12:32,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 496 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:32,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-17 15:12:32,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:32,898 INFO L124 PetriNetUnfolderBase]: 2497/4180 cut-off events. [2023-11-17 15:12:32,898 INFO L125 PetriNetUnfolderBase]: For 11589/12093 co-relation queries the response was YES. [2023-11-17 15:12:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18568 conditions, 4180 events. 2497/4180 cut-off events. For 11589/12093 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 27592 event pairs, 262 based on Foata normal form. 209/4245 useless extension candidates. Maximal degree in co-relation 18534. Up to 1399 conditions per place. [2023-11-17 15:12:32,918 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 56 selfloop transitions, 21 changer transitions 44/128 dead transitions. [2023-11-17 15:12:32,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 1080 flow [2023-11-17 15:12:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:12:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:12:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1224 transitions. [2023-11-17 15:12:32,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818897637795276 [2023-11-17 15:12:32,921 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1224 transitions. [2023-11-17 15:12:32,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1224 transitions. [2023-11-17 15:12:32,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:32,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1224 transitions. [2023-11-17 15:12:32,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.4) internal successors, (1224), 10 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 254.0) internal successors, (2794), 11 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,927 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 254.0) internal successors, (2794), 11 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:32,927 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 496 flow. Second operand 10 states and 1224 transitions. [2023-11-17 15:12:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 1080 flow [2023-11-17 15:12:33,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 128 transitions, 966 flow, removed 42 selfloop flow, removed 6 redundant places. [2023-11-17 15:12:33,183 INFO L231 Difference]: Finished difference. Result has 80 places, 47 transitions, 358 flow [2023-11-17 15:12:33,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=358, PETRI_PLACES=80, PETRI_TRANSITIONS=47} [2023-11-17 15:12:33,184 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2023-11-17 15:12:33,184 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 47 transitions, 358 flow [2023-11-17 15:12:33,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:33,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:33,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:33,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:12:33,185 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:33,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -744779799, now seen corresponding path program 1 times [2023-11-17 15:12:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445478215] [2023-11-17 15:12:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445478215] [2023-11-17 15:12:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445478215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:33,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566650233] [2023-11-17 15:12:33,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:33,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:33,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2023-11-17 15:12:33,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 47 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:33,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:33,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2023-11-17 15:12:33,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:33,589 INFO L124 PetriNetUnfolderBase]: 1054/1832 cut-off events. [2023-11-17 15:12:33,589 INFO L125 PetriNetUnfolderBase]: For 4975/5001 co-relation queries the response was YES. [2023-11-17 15:12:33,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7890 conditions, 1832 events. 1054/1832 cut-off events. For 4975/5001 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10241 event pairs, 211 based on Foata normal form. 9/1800 useless extension candidates. Maximal degree in co-relation 7861. Up to 897 conditions per place. [2023-11-17 15:12:33,596 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 39 selfloop transitions, 1 changer transitions 52/95 dead transitions. [2023-11-17 15:12:33,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 885 flow [2023-11-17 15:12:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-11-17 15:12:33,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514763779527559 [2023-11-17 15:12:33,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-11-17 15:12:33,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-11-17 15:12:33,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:33,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-11-17 15:12:33,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:33,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:33,601 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:33,601 INFO L175 Difference]: Start difference. First operand has 80 places, 47 transitions, 358 flow. Second operand 4 states and 523 transitions. [2023-11-17 15:12:33,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 885 flow [2023-11-17 15:12:33,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 681 flow, removed 47 selfloop flow, removed 16 redundant places. [2023-11-17 15:12:33,621 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 197 flow [2023-11-17 15:12:33,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-11-17 15:12:33,621 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-11-17 15:12:33,621 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 197 flow [2023-11-17 15:12:33,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:33,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:33,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:33,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:12:33,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:33,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:33,622 INFO L85 PathProgramCache]: Analyzing trace with hash -216638597, now seen corresponding path program 2 times [2023-11-17 15:12:33,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115149371] [2023-11-17 15:12:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:34,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115149371] [2023-11-17 15:12:34,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115149371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:34,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313273302] [2023-11-17 15:12:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:34,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:12:34,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:12:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:12:34,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2023-11-17 15:12:34,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:34,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:34,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2023-11-17 15:12:34,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:34,602 INFO L124 PetriNetUnfolderBase]: 244/468 cut-off events. [2023-11-17 15:12:34,602 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2023-11-17 15:12:34,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 468 events. 244/468 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1860 event pairs, 48 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1660. Up to 148 conditions per place. [2023-11-17 15:12:34,607 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 34 selfloop transitions, 4 changer transitions 38/80 dead transitions. [2023-11-17 15:12:34,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 579 flow [2023-11-17 15:12:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:12:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:12:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 933 transitions. [2023-11-17 15:12:34,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45915354330708663 [2023-11-17 15:12:34,609 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 933 transitions. [2023-11-17 15:12:34,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 933 transitions. [2023-11-17 15:12:34,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:34,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 933 transitions. [2023-11-17 15:12:34,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:34,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 254.0) internal successors, (2286), 9 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:34,615 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 254.0) internal successors, (2286), 9 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:34,615 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 197 flow. Second operand 8 states and 933 transitions. [2023-11-17 15:12:34,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 579 flow [2023-11-17 15:12:34,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 552 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-11-17 15:12:34,619 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 196 flow [2023-11-17 15:12:34,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-11-17 15:12:34,620 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-11-17 15:12:34,621 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 196 flow [2023-11-17 15:12:34,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:34,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:34,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:34,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:12:34,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:34,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 105650937, now seen corresponding path program 3 times [2023-11-17 15:12:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414449295] [2023-11-17 15:12:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:12:34,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:12:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:12:34,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:12:34,716 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:12:34,716 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:12:34,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:12:34,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:12:34,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:12:34,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:12:34,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:12:34,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:12:34,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:12:34,718 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:34,722 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:12:34,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:12:34,767 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:12:34,769 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:12:34,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:12:34,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-17 15:12:34,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:34 BasicIcfg [2023-11-17 15:12:34,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:12:34,800 INFO L158 Benchmark]: Toolchain (without parser) took 15641.57ms. Allocated memory was 270.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 214.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 430.8MB. Max. memory is 8.0GB. [2023-11-17 15:12:34,800 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:12:34,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.09ms. Allocated memory is still 270.5MB. Free memory was 214.4MB in the beginning and 190.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:34,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 270.5MB. Free memory was 190.2MB in the beginning and 187.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:34,801 INFO L158 Benchmark]: Boogie Preprocessor took 21.52ms. Allocated memory is still 270.5MB. Free memory was 187.6MB in the beginning and 185.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:34,801 INFO L158 Benchmark]: RCFGBuilder took 639.02ms. Allocated memory is still 270.5MB. Free memory was 185.5MB in the beginning and 228.1MB in the end (delta: -42.5MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. [2023-11-17 15:12:34,801 INFO L158 Benchmark]: TraceAbstraction took 14510.94ms. Allocated memory was 270.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 227.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 441.9MB. Max. memory is 8.0GB. [2023-11-17 15:12:34,802 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.09ms. Allocated memory is still 270.5MB. Free memory was 214.4MB in the beginning and 190.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 270.5MB. Free memory was 190.2MB in the beginning and 187.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.52ms. Allocated memory is still 270.5MB. Free memory was 187.6MB in the beginning and 185.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 639.02ms. Allocated memory is still 270.5MB. Free memory was 185.5MB in the beginning and 228.1MB in the end (delta: -42.5MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. * TraceAbstraction took 14510.94ms. Allocated memory was 270.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 227.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 441.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 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.8s, 143 PlacesBefore, 41 PlacesAfterwards, 132 TransitionsBefore, 29 TransitionsAfterwards, 3490 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7700 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3762, independent: 3556, independent conditional: 0, independent unconditional: 3556, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2443, independent: 2372, independent conditional: 0, independent unconditional: 2372, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2443, independent: 2344, independent conditional: 0, independent unconditional: 2344, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 360, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 278, dependent conditional: 0, dependent unconditional: 278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3762, independent: 1184, independent conditional: 0, independent unconditional: 1184, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 2443, unknown conditional: 0, unknown unconditional: 2443] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, t182={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1147 IncrementalHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 18 mSDtfsCounter, 1147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=9, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:12:34,824 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...