/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 --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:24:34,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:24:34,225 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 11:24:34,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:24:34,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:24:34,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:24:34,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:24:34,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:24:34,263 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:24:34,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:24:34,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:24:34,267 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:24:34,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:24:34,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:24:34,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:24:34,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:24:34,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:24:34,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:24:34,269 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:24:34,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:24:34,270 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:24:34,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:24:34,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:24:34,271 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:24:34,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:24:34,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:34,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:24:34,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:24:34,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:24:34,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:24:34,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:24:34,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:24:34,273 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:24:34,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:24:34,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:24:34,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:24:34,516 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:24:34,516 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:24:34,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-11-17 11:24:35,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:24:35,872 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:24:35,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-11-17 11:24:35,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9144eaec9/aa682cec38084160ab5bedf47dee3970/FLAGe59ee2546 [2023-11-17 11:24:35,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9144eaec9/aa682cec38084160ab5bedf47dee3970 [2023-11-17 11:24:35,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:24:35,916 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:24:35,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:35,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:24:35,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:24:35,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:35" (1/1) ... [2023-11-17 11:24:35,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3b7b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:35, skipping insertion in model container [2023-11-17 11:24:35,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:35" (1/1) ... [2023-11-17 11:24:35,982 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:24:36,126 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/mix015.oepc.i[945,958] [2023-11-17 11:24:36,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:36,340 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:24:36,351 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/mix015.oepc.i[945,958] [2023-11-17 11:24:36,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:36,431 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:36,432 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:36,437 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:24:36,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36 WrapperNode [2023-11-17 11:24:36,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:36,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:36,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:24:36,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:24:36,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,499 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-11-17 11:24:36,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:36,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:24:36,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:24:36,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:24:36,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:24:36,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:24:36,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:24:36,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:24:36,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (1/1) ... [2023-11-17 11:24:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:36,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:24:36,581 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 11:24:36,595 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 11:24:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:24:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:24:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:24:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:24:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:24:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:24:36,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:24:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:24:36,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:24:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:24:36,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:24:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:24:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:24:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:24:36,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:24:36,618 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 11:24:36,750 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:24:36,751 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:24:37,012 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:24:37,198 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:24:37,198 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:24:37,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:37 BoogieIcfgContainer [2023-11-17 11:24:37,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:24:37,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:24:37,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:24:37,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:24:37,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:24:35" (1/3) ... [2023-11-17 11:24:37,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4579ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:37, skipping insertion in model container [2023-11-17 11:24:37,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:36" (2/3) ... [2023-11-17 11:24:37,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4579ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:37, skipping insertion in model container [2023-11-17 11:24:37,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:37" (3/3) ... [2023-11-17 11:24:37,205 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-11-17 11:24:37,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:24:37,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:24:37,239 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:24:37,279 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:24:37,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2023-11-17 11:24:37,351 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-17 11:24:37,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:37,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-17 11:24:37,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2023-11-17 11:24:37,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:37,364 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:24:37,383 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:37,387 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:37,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:37,403 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-17 11:24:37,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:37,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-17 11:24:37,405 INFO L119 LiptonReduction]: Number of co-enabled transitions 954 [2023-11-17 11:24:38,356 INFO L134 LiptonReduction]: Checked pairs total: 2670 [2023-11-17 11:24:38,356 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:24:38,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:24:38,372 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;@4ecc96f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:24:38,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:24:38,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:24:38,375 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 11:24:38,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:38,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:38,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:24:38,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:38,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash 373415, now seen corresponding path program 1 times [2023-11-17 11:24:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190942230] [2023-11-17 11:24:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:38,737 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 11:24:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:38,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190942230] [2023-11-17 11:24:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190942230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438890575] [2023-11-17 11:24:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:38,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:38,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:38,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2023-11-17 11:24:38,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 11:24:38,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:38,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2023-11-17 11:24:38,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:39,105 INFO L124 PetriNetUnfolderBase]: 895/1563 cut-off events. [2023-11-17 11:24:39,105 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:24:39,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 1563 events. 895/1563 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8906 event pairs, 142 based on Foata normal form. 0/1477 useless extension candidates. Maximal degree in co-relation 2935. Up to 1084 conditions per place. [2023-11-17 11:24:39,115 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-11-17 11:24:39,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 163 flow [2023-11-17 11:24:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2023-11-17 11:24:39,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515625 [2023-11-17 11:24:39,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 99 transitions. [2023-11-17 11:24:39,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 99 transitions. [2023-11-17 11:24:39,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:39,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 99 transitions. [2023-11-17 11:24:39,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 11:24:39,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 11:24:39,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 11:24:39,133 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 59 flow. Second operand 3 states and 99 transitions. [2023-11-17 11:24:39,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 163 flow [2023-11-17 11:24:39,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:39,136 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-11-17 11:24:39,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:24:39,140 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 11:24:39,140 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-11-17 11:24:39,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 11:24:39,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:39,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:39,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:24:39,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:39,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1894772150, now seen corresponding path program 1 times [2023-11-17 11:24:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581703300] [2023-11-17 11:24:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:39,327 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 11:24:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581703300] [2023-11-17 11:24:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581703300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847343128] [2023-11-17 11:24:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:39,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:39,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2023-11-17 11:24:39,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 11:24:39,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:39,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2023-11-17 11:24:39,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:39,559 INFO L124 PetriNetUnfolderBase]: 775/1173 cut-off events. [2023-11-17 11:24:39,559 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-11-17 11:24:39,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 1173 events. 775/1173 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5156 event pairs, 263 based on Foata normal form. 32/1200 useless extension candidates. Maximal degree in co-relation 2475. Up to 817 conditions per place. [2023-11-17 11:24:39,565 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-11-17 11:24:39,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 130 flow [2023-11-17 11:24:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-17 11:24:39,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-11-17 11:24:39,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-17 11:24:39,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-17 11:24:39,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:39,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-17 11:24:39,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 11:24:39,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 11:24:39,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 11:24:39,574 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 86 transitions. [2023-11-17 11:24:39,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 130 flow [2023-11-17 11:24:39,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:39,576 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2023-11-17 11:24:39,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:24:39,577 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 11:24:39,577 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow [2023-11-17 11:24:39,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 11:24:39,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:39,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:39,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:24:39,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:39,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash -190189305, now seen corresponding path program 1 times [2023-11-17 11:24:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516451786] [2023-11-17 11:24:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:39,788 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 11:24:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:39,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516451786] [2023-11-17 11:24:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516451786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:39,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760116867] [2023-11-17 11:24:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:39,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2023-11-17 11:24:39,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 11:24:39,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:39,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2023-11-17 11:24:39,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:40,046 INFO L124 PetriNetUnfolderBase]: 1445/2138 cut-off events. [2023-11-17 11:24:40,046 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-17 11:24:40,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 2138 events. 1445/2138 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9407 event pairs, 413 based on Foata normal form. 40/2178 useless extension candidates. Maximal degree in co-relation 4604. Up to 1581 conditions per place. [2023-11-17 11:24:40,058 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 36 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-11-17 11:24:40,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 173 flow [2023-11-17 11:24:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-17 11:24:40,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2023-11-17 11:24:40,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-17 11:24:40,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-17 11:24:40,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:40,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-17 11:24:40,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 11:24:40,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 11:24:40,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 11:24:40,065 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 3 states and 87 transitions. [2023-11-17 11:24:40,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 173 flow [2023-11-17 11:24:40,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:40,067 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2023-11-17 11:24:40,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-17 11:24:40,068 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2023-11-17 11:24:40,068 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2023-11-17 11:24:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 11:24:40,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:40,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:40,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:24:40,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:40,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 881909561, now seen corresponding path program 1 times [2023-11-17 11:24:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002296645] [2023-11-17 11:24:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002296645] [2023-11-17 11:24:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002296645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:40,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:40,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:40,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382380762] [2023-11-17 11:24:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:40,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:40,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:40,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-17 11:24:40,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 11:24:40,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:40,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-17 11:24:40,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:40,341 INFO L124 PetriNetUnfolderBase]: 501/845 cut-off events. [2023-11-17 11:24:40,341 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:24:40,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 845 events. 501/845 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4144 event pairs, 145 based on Foata normal form. 80/917 useless extension candidates. Maximal degree in co-relation 1783. Up to 321 conditions per place. [2023-11-17 11:24:40,344 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 38 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2023-11-17 11:24:40,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 206 flow [2023-11-17 11:24:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-11-17 11:24:40,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2023-11-17 11:24:40,346 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 114 transitions. [2023-11-17 11:24:40,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 114 transitions. [2023-11-17 11:24:40,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:40,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 114 transitions. [2023-11-17 11:24:40,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 11:24:40,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 11:24:40,348 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 11:24:40,348 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 4 states and 114 transitions. [2023-11-17 11:24:40,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 206 flow [2023-11-17 11:24:40,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:40,350 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 94 flow [2023-11-17 11:24:40,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-11-17 11:24:40,352 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-11-17 11:24:40,352 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 94 flow [2023-11-17 11:24:40,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 11:24:40,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:40,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:40,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:24:40,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:40,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash -518749433, now seen corresponding path program 1 times [2023-11-17 11:24:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:40,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170802517] [2023-11-17 11:24:40,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:40,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:40,511 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 11:24:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170802517] [2023-11-17 11:24:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170802517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130252124] [2023-11-17 11:24:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:40,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:40,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-17 11:24:40,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 11:24:40,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:40,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-17 11:24:40,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:40,645 INFO L124 PetriNetUnfolderBase]: 252/464 cut-off events. [2023-11-17 11:24:40,646 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-17 11:24:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 464 events. 252/464 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2049 event pairs, 68 based on Foata normal form. 44/501 useless extension candidates. Maximal degree in co-relation 1240. Up to 194 conditions per place. [2023-11-17 11:24:40,648 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 47 selfloop transitions, 8 changer transitions 1/60 dead transitions. [2023-11-17 11:24:40,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 295 flow [2023-11-17 11:24:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2023-11-17 11:24:40,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446875 [2023-11-17 11:24:40,649 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 143 transitions. [2023-11-17 11:24:40,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 143 transitions. [2023-11-17 11:24:40,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:40,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 143 transitions. [2023-11-17 11:24:40,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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 11:24:40,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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 11:24:40,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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 11:24:40,651 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 94 flow. Second operand 5 states and 143 transitions. [2023-11-17 11:24:40,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 295 flow [2023-11-17 11:24:40,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 285 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:40,652 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 134 flow [2023-11-17 11:24:40,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 11:24:40,653 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-11-17 11:24:40,653 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 134 flow [2023-11-17 11:24:40,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 11:24:40,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:40,654 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 11:24:40,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:24:40,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:40,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash 422538395, now seen corresponding path program 1 times [2023-11-17 11:24:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597281034] [2023-11-17 11:24:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:40,965 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 11:24:40,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:40,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597281034] [2023-11-17 11:24:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597281034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:40,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413845568] [2023-11-17 11:24:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:40,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:40,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-17 11:24:40,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 11:24:40,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:40,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-17 11:24:40,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:41,195 INFO L124 PetriNetUnfolderBase]: 314/657 cut-off events. [2023-11-17 11:24:41,195 INFO L125 PetriNetUnfolderBase]: For 742/742 co-relation queries the response was YES. [2023-11-17 11:24:41,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 657 events. 314/657 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3416 event pairs, 73 based on Foata normal form. 7/660 useless extension candidates. Maximal degree in co-relation 2000. Up to 283 conditions per place. [2023-11-17 11:24:41,198 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 53 selfloop transitions, 9 changer transitions 24/90 dead transitions. [2023-11-17 11:24:41,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 90 transitions, 628 flow [2023-11-17 11:24:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2023-11-17 11:24:41,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817708333333333 [2023-11-17 11:24:41,199 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 185 transitions. [2023-11-17 11:24:41,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 185 transitions. [2023-11-17 11:24:41,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:41,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 185 transitions. [2023-11-17 11:24:41,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 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 11:24:41,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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 11:24:41,202 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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 11:24:41,202 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 134 flow. Second operand 6 states and 185 transitions. [2023-11-17 11:24:41,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 90 transitions, 628 flow [2023-11-17 11:24:41,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 90 transitions, 536 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-11-17 11:24:41,208 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 178 flow [2023-11-17 11:24:41,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-17 11:24:41,210 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-11-17 11:24:41,210 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 178 flow [2023-11-17 11:24:41,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 11:24:41,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:41,211 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 11:24:41,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:24:41,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:41,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -787403703, now seen corresponding path program 2 times [2023-11-17 11:24:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90476617] [2023-11-17 11:24:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:41,401 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 11:24:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90476617] [2023-11-17 11:24:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90476617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:41,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:41,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:24:41,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552095967] [2023-11-17 11:24:41,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:24:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:41,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:24:41,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:24:41,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-17 11:24:41,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 11:24:41,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:41,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-17 11:24:41,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:41,523 INFO L124 PetriNetUnfolderBase]: 235/473 cut-off events. [2023-11-17 11:24:41,523 INFO L125 PetriNetUnfolderBase]: For 544/551 co-relation queries the response was YES. [2023-11-17 11:24:41,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 473 events. 235/473 cut-off events. For 544/551 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2269 event pairs, 58 based on Foata normal form. 22/486 useless extension candidates. Maximal degree in co-relation 1508. Up to 173 conditions per place. [2023-11-17 11:24:41,526 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 50 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2023-11-17 11:24:41,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 415 flow [2023-11-17 11:24:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2023-11-17 11:24:41,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2023-11-17 11:24:41,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 150 transitions. [2023-11-17 11:24:41,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 150 transitions. [2023-11-17 11:24:41,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:41,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 150 transitions. [2023-11-17 11:24:41,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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 11:24:41,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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 11:24:41,529 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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 11:24:41,529 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 178 flow. Second operand 6 states and 150 transitions. [2023-11-17 11:24:41,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 415 flow [2023-11-17 11:24:41,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 405 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:41,532 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 199 flow [2023-11-17 11:24:41,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-11-17 11:24:41,532 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-11-17 11:24:41,533 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 199 flow [2023-11-17 11:24:41,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 11:24:41,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:41,533 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 11:24:41,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:24:41,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:41,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash 792666305, now seen corresponding path program 1 times [2023-11-17 11:24:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:41,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254370827] [2023-11-17 11:24:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:41,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:41,704 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 11:24:41,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:41,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254370827] [2023-11-17 11:24:41,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254370827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:41,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:41,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020523287] [2023-11-17 11:24:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:41,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:41,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:41,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-17 11:24:41,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 11:24:41,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:41,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-17 11:24:41,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:41,843 INFO L124 PetriNetUnfolderBase]: 380/748 cut-off events. [2023-11-17 11:24:41,843 INFO L125 PetriNetUnfolderBase]: For 1131/1131 co-relation queries the response was YES. [2023-11-17 11:24:41,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 748 events. 380/748 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3880 event pairs, 36 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 2554. Up to 316 conditions per place. [2023-11-17 11:24:41,852 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 45 selfloop transitions, 1 changer transitions 27/76 dead transitions. [2023-11-17 11:24:41,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 76 transitions, 580 flow [2023-11-17 11:24:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-17 11:24:41,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2023-11-17 11:24:41,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-17 11:24:41,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-17 11:24:41,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:41,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-17 11:24:41,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 11:24:41,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 11:24:41,855 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 11:24:41,855 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 199 flow. Second operand 4 states and 115 transitions. [2023-11-17 11:24:41,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 76 transitions, 580 flow [2023-11-17 11:24:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 76 transitions, 442 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-11-17 11:24:41,859 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 135 flow [2023-11-17 11:24:41,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-17 11:24:41,861 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2023-11-17 11:24:41,861 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 135 flow [2023-11-17 11:24:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 11:24:41,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:41,861 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 11:24:41,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:24:41,861 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:41,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1125229515, now seen corresponding path program 2 times [2023-11-17 11:24:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737176001] [2023-11-17 11:24:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737176001] [2023-11-17 11:24:42,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737176001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:42,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:42,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779228017] [2023-11-17 11:24:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:42,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:42,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-17 11:24:42,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 11:24:42,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:42,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-17 11:24:42,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:42,133 INFO L124 PetriNetUnfolderBase]: 389/756 cut-off events. [2023-11-17 11:24:42,133 INFO L125 PetriNetUnfolderBase]: For 583/584 co-relation queries the response was YES. [2023-11-17 11:24:42,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 756 events. 389/756 cut-off events. For 583/584 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3758 event pairs, 112 based on Foata normal form. 1/746 useless extension candidates. Maximal degree in co-relation 2195. Up to 325 conditions per place. [2023-11-17 11:24:42,136 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 38 selfloop transitions, 1 changer transitions 29/70 dead transitions. [2023-11-17 11:24:42,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 421 flow [2023-11-17 11:24:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2023-11-17 11:24:42,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2023-11-17 11:24:42,137 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 108 transitions. [2023-11-17 11:24:42,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 108 transitions. [2023-11-17 11:24:42,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:42,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 108 transitions. [2023-11-17 11:24:42,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 11:24:42,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 11:24:42,138 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 11:24:42,138 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 135 flow. Second operand 4 states and 108 transitions. [2023-11-17 11:24:42,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 421 flow [2023-11-17 11:24:42,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 70 transitions, 413 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:42,140 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 127 flow [2023-11-17 11:24:42,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-17 11:24:42,141 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-11-17 11:24:42,141 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 127 flow [2023-11-17 11:24:42,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 11:24:42,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:42,143 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 11:24:42,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:24:42,144 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:42,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1337665313, now seen corresponding path program 3 times [2023-11-17 11:24:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:42,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772243800] [2023-11-17 11:24:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:42,799 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 11:24:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:42,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772243800] [2023-11-17 11:24:42,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772243800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:42,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:42,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:24:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757852573] [2023-11-17 11:24:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:42,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:24:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:42,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:24:42,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:24:42,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-17 11:24:42,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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 11:24:42,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:42,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-17 11:24:42,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:43,008 INFO L124 PetriNetUnfolderBase]: 205/476 cut-off events. [2023-11-17 11:24:43,008 INFO L125 PetriNetUnfolderBase]: For 382/400 co-relation queries the response was YES. [2023-11-17 11:24:43,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 476 events. 205/476 cut-off events. For 382/400 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2390 event pairs, 28 based on Foata normal form. 17/486 useless extension candidates. Maximal degree in co-relation 1363. Up to 183 conditions per place. [2023-11-17 11:24:43,010 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 33 selfloop transitions, 4 changer transitions 30/71 dead transitions. [2023-11-17 11:24:43,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 405 flow [2023-11-17 11:24:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:24:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:24:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2023-11-17 11:24:43,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2023-11-17 11:24:43,011 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 188 transitions. [2023-11-17 11:24:43,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 188 transitions. [2023-11-17 11:24:43,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:43,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 188 transitions. [2023-11-17 11:24:43,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 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 11:24:43,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 64.0) internal successors, (512), 8 states have internal predecessors, (512), 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 11:24:43,013 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 64.0) internal successors, (512), 8 states have internal predecessors, (512), 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 11:24:43,013 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 127 flow. Second operand 7 states and 188 transitions. [2023-11-17 11:24:43,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 405 flow [2023-11-17 11:24:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 400 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:43,015 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 127 flow [2023-11-17 11:24:43,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=124, 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=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2023-11-17 11:24:43,016 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2023-11-17 11:24:43,016 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 127 flow [2023-11-17 11:24:43,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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 11:24:43,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:43,016 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 11:24:43,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:24:43,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:43,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -600957719, now seen corresponding path program 4 times [2023-11-17 11:24:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178237632] [2023-11-17 11:24:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:43,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:24:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:43,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:24:43,100 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:24:43,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:24:43,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:24:43,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:24:43,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:24:43,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:24:43,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:24:43,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:24:43,102 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2023-11-17 11:24:43,106 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:24:43,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:24:43,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:24:43,132 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:24:43,133 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:24:43,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:24:43 BasicIcfg [2023-11-17 11:24:43,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:24:43,149 INFO L158 Benchmark]: Toolchain (without parser) took 7233.30ms. Allocated memory was 330.3MB in the beginning and 558.9MB in the end (delta: 228.6MB). Free memory was 277.2MB in the beginning and 291.2MB in the end (delta: -13.9MB). Peak memory consumption was 215.2MB. Max. memory is 8.0GB. [2023-11-17 11:24:43,149 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 231.7MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:24:43,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.48ms. Allocated memory is still 330.3MB. Free memory was 277.0MB in the beginning and 253.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:43,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.26ms. Allocated memory is still 330.3MB. Free memory was 253.4MB in the beginning and 251.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:43,150 INFO L158 Benchmark]: Boogie Preprocessor took 35.86ms. Allocated memory is still 330.3MB. Free memory was 250.8MB in the beginning and 248.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:43,150 INFO L158 Benchmark]: RCFGBuilder took 663.44ms. Allocated memory is still 330.3MB. Free memory was 248.9MB in the beginning and 258.4MB in the end (delta: -9.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2023-11-17 11:24:43,150 INFO L158 Benchmark]: TraceAbstraction took 5948.17ms. Allocated memory was 330.3MB in the beginning and 558.9MB in the end (delta: 228.6MB). Free memory was 257.9MB in the beginning and 291.2MB in the end (delta: -33.3MB). Peak memory consumption was 195.3MB. Max. memory is 8.0GB. [2023-11-17 11:24:43,151 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.12ms. Allocated memory is still 231.7MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.48ms. Allocated memory is still 330.3MB. Free memory was 277.0MB in the beginning and 253.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.26ms. Allocated memory is still 330.3MB. Free memory was 253.4MB in the beginning and 251.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.86ms. Allocated memory is still 330.3MB. Free memory was 250.8MB in the beginning and 248.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 663.44ms. Allocated memory is still 330.3MB. Free memory was 248.9MB in the beginning and 258.4MB in the end (delta: -9.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5948.17ms. Allocated memory was 330.3MB in the beginning and 558.9MB in the end (delta: 228.6MB). Free memory was 257.9MB in the beginning and 291.2MB in the end (delta: -33.3MB). Peak memory consumption was 195.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 48 PlacesBefore, 35 PlacesAfterwards, 40 TransitionsBefore, 25 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 2670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1085, independent: 975, independent conditional: 0, independent unconditional: 975, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 643, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 643, independent: 583, independent conditional: 0, independent unconditional: 583, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1085, independent: 388, independent conditional: 0, independent unconditional: 388, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 643, unknown conditional: 0, unknown unconditional: 643] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 790 IncrementalHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 7 mSDtfsCounter, 790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:24:43,180 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...