/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:11:33,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:11:34,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:11:34,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:11:34,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:11:34,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:11:34,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:11:34,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:11:34,088 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:11:34,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:11:34,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:11:34,091 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:11:34,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:11:34,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:11:34,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:11:34,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:11:34,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:11:34,094 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:11:34,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:11:34,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:11:34,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:11:34,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:11:34,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:11:34,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:11:34,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:11:34,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:11:34,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:11:34,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:11:34,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:11:34,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:11:34,351 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:11:34,351 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:11:34,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-11-17 15:11:35,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:11:35,830 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:11:35,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-11-17 15:11:35,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219fbc384/f4af6dab9e10491b981c81956b09658a/FLAG96d854f8e [2023-11-17 15:11:35,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219fbc384/f4af6dab9e10491b981c81956b09658a [2023-11-17 15:11:35,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:11:35,863 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:11:35,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:11:35,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:11:35,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:11:35,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:11:35" (1/1) ... [2023-11-17 15:11:35,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3028f523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:35, skipping insertion in model container [2023-11-17 15:11:35,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:11:35" (1/1) ... [2023-11-17 15:11:35,912 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:11:36,044 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/mix002.opt.i[944,957] [2023-11-17 15:11:36,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:11:36,299 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:11:36,309 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/mix002.opt.i[944,957] [2023-11-17 15:11:36,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:11:36,374 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:11:36,374 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:11:36,379 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:11:36,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36 WrapperNode [2023-11-17 15:11:36,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:11:36,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:11:36,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:11:36,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:11:36,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,444 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-11-17 15:11:36,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:11:36,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:11:36,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:11:36,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:11:36,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:11:36,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:11:36,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:11:36,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:11:36,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (1/1) ... [2023-11-17 15:11:36,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:11:36,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:11:36,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:11:36,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:11:36,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:11:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:11:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:11:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:11:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:11:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:11:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:11:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:11:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:11:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:11:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:11:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:11:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:11:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:11:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:11:36,547 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:11:36,686 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:11:36,688 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:11:36,995 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:11:37,117 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:11:37,117 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:11:37,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:11:37 BoogieIcfgContainer [2023-11-17 15:11:37,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:11:37,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:11:37,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:11:37,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:11:37,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:11:35" (1/3) ... [2023-11-17 15:11:37,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9c15e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:11:37, skipping insertion in model container [2023-11-17 15:11:37,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:36" (2/3) ... [2023-11-17 15:11:37,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9c15e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:11:37, skipping insertion in model container [2023-11-17 15:11:37,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:11:37" (3/3) ... [2023-11-17 15:11:37,125 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-11-17 15:11:37,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:11:37,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:11:37,137 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:11:37,189 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:11:37,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 252 flow [2023-11-17 15:11:37,273 INFO L124 PetriNetUnfolderBase]: 2/117 cut-off events. [2023-11-17 15:11:37,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:11:37,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-17 15:11:37,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 252 flow [2023-11-17 15:11:37,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2023-11-17 15:11:37,288 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:11:37,300 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2023-11-17 15:11:37,303 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2023-11-17 15:11:37,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2023-11-17 15:11:37,335 INFO L124 PetriNetUnfolderBase]: 2/117 cut-off events. [2023-11-17 15:11:37,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:11:37,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-17 15:11:37,339 INFO L119 LiptonReduction]: Number of co-enabled transitions 2530 [2023-11-17 15:11:41,003 INFO L134 LiptonReduction]: Checked pairs total: 5992 [2023-11-17 15:11:41,004 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-11-17 15:11:41,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:11:41,021 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;@6c2a9d97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:11:41,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:11:41,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:11:41,025 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-17 15:11:41,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:11:41,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:41,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:41,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:41,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1842911802, now seen corresponding path program 1 times [2023-11-17 15:11:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426510270] [2023-11-17 15:11:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426510270] [2023-11-17 15:11:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426510270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:41,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:11:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043041350] [2023-11-17 15:11:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:41,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:11:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:11:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:11:41,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2023-11-17 15:11:41,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:41,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2023-11-17 15:11:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:41,603 INFO L124 PetriNetUnfolderBase]: 895/1426 cut-off events. [2023-11-17 15:11:41,603 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 15:11:41,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1426 events. 895/1426 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7082 event pairs, 159 based on Foata normal form. 0/1341 useless extension candidates. Maximal degree in co-relation 2798. Up to 1057 conditions per place. [2023-11-17 15:11:41,614 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-17 15:11:41,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 135 flow [2023-11-17 15:11:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:11:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:11:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-17 15:11:41,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198237885462555 [2023-11-17 15:11:41,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-17 15:11:41,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-17 15:11:41,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:41,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-17 15:11:41,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,642 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 354 transitions. [2023-11-17 15:11:41,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 135 flow [2023-11-17 15:11:41,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:11:41,646 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 15:11:41,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 15:11:41,651 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 15:11:41,651 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 15:11:41,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:41,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:41,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:11:41,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:41,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1511654793, now seen corresponding path program 1 times [2023-11-17 15:11:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:41,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570405780] [2023-11-17 15:11:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:41,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:41,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570405780] [2023-11-17 15:11:41,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570405780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:11:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19426349] [2023-11-17 15:11:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:41,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:11:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:11:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:11:41,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 227 [2023-11-17 15:11:41,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:41,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 227 [2023-11-17 15:11:41,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:41,951 INFO L124 PetriNetUnfolderBase]: 631/1018 cut-off events. [2023-11-17 15:11:41,951 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-17 15:11:41,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 1018 events. 631/1018 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4618 event pairs, 247 based on Foata normal form. 32/1045 useless extension candidates. Maximal degree in co-relation 2062. Up to 609 conditions per place. [2023-11-17 15:11:41,955 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-11-17 15:11:41,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 124 flow [2023-11-17 15:11:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:11:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:11:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-11-17 15:11:41,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080763582966226 [2023-11-17 15:11:41,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-11-17 15:11:41,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-11-17 15:11:41,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:41,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-11-17 15:11:41,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,964 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 346 transitions. [2023-11-17 15:11:41,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 124 flow [2023-11-17 15:11:41,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:11:41,966 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-11-17 15:11:41,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 15:11:41,967 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 15:11:41,967 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-11-17 15:11:41,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:41,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:41,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:41,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:11:41,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:41,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1003027177, now seen corresponding path program 1 times [2023-11-17 15:11:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732076573] [2023-11-17 15:11:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:42,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:42,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732076573] [2023-11-17 15:11:42,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732076573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:42,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:42,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:11:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202614160] [2023-11-17 15:11:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:42,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:11:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:42,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:11:42,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:11:42,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 227 [2023-11-17 15:11:42,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:42,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 227 [2023-11-17 15:11:42,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:42,444 INFO L124 PetriNetUnfolderBase]: 1167/1738 cut-off events. [2023-11-17 15:11:42,444 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2023-11-17 15:11:42,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3753 conditions, 1738 events. 1167/1738 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7205 event pairs, 399 based on Foata normal form. 40/1778 useless extension candidates. Maximal degree in co-relation 3742. Up to 1169 conditions per place. [2023-11-17 15:11:42,451 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-17 15:11:42,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2023-11-17 15:11:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:11:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:11:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-17 15:11:42,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801762114537445 [2023-11-17 15:11:42,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-17 15:11:42,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-17 15:11:42,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:42,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-17 15:11:42,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,456 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 327 transitions. [2023-11-17 15:11:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2023-11-17 15:11:42,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:11:42,457 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2023-11-17 15:11:42,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-17 15:11:42,458 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-11-17 15:11:42,458 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2023-11-17 15:11:42,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:42,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:42,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:11:42,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:42,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -321241550, now seen corresponding path program 1 times [2023-11-17 15:11:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939339620] [2023-11-17 15:11:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939339620] [2023-11-17 15:11:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939339620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:11:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755586180] [2023-11-17 15:11:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:42,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:11:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:11:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:11:42,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2023-11-17 15:11:42,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:42,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2023-11-17 15:11:42,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:42,744 INFO L124 PetriNetUnfolderBase]: 560/945 cut-off events. [2023-11-17 15:11:42,744 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-17 15:11:42,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 945 events. 560/945 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4551 event pairs, 238 based on Foata normal form. 18/951 useless extension candidates. Maximal degree in co-relation 1932. Up to 490 conditions per place. [2023-11-17 15:11:42,748 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 30 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-17 15:11:42,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 157 flow [2023-11-17 15:11:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:11:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:11:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-17 15:11:42,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110132158590308 [2023-11-17 15:11:42,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-17 15:11:42,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-17 15:11:42,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:42,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-17 15:11:42,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,753 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 3 states and 348 transitions. [2023-11-17 15:11:42,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 157 flow [2023-11-17 15:11:42,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:11:42,754 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 66 flow [2023-11-17 15:11:42,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-11-17 15:11:42,755 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-11-17 15:11:42,755 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 66 flow [2023-11-17 15:11:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:42,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:42,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:11:42,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:42,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1898108679, now seen corresponding path program 1 times [2023-11-17 15:11:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:42,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336211508] [2023-11-17 15:11:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336211508] [2023-11-17 15:11:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336211508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:42,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:11:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074438129] [2023-11-17 15:11:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:42,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:11:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:11:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:11:42,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 227 [2023-11-17 15:11:42,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:42,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:42,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 227 [2023-11-17 15:11:42,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:43,072 INFO L124 PetriNetUnfolderBase]: 472/792 cut-off events. [2023-11-17 15:11:43,072 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-11-17 15:11:43,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 792 events. 472/792 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3600 event pairs, 101 based on Foata normal form. 80/868 useless extension candidates. Maximal degree in co-relation 1829. Up to 427 conditions per place. [2023-11-17 15:11:43,076 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 29 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2023-11-17 15:11:43,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 260 flow [2023-11-17 15:11:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:11:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:11:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-11-17 15:11:43,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986784140969164 [2023-11-17 15:11:43,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-11-17 15:11:43,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-11-17 15:11:43,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:43,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-11-17 15:11:43,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,082 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 66 flow. Second operand 5 states and 556 transitions. [2023-11-17 15:11:43,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 260 flow [2023-11-17 15:11:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:11:43,084 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 98 flow [2023-11-17 15:11:43,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-11-17 15:11:43,084 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-11-17 15:11:43,085 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 98 flow [2023-11-17 15:11:43,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:43,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:43,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:11:43,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:43,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2091484163, now seen corresponding path program 1 times [2023-11-17 15:11:43,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:43,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930333815] [2023-11-17 15:11:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:43,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930333815] [2023-11-17 15:11:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930333815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:43,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:43,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:11:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319415962] [2023-11-17 15:11:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:43,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:11:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:11:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:11:43,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2023-11-17 15:11:43,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:43,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2023-11-17 15:11:43,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:43,411 INFO L124 PetriNetUnfolderBase]: 667/1121 cut-off events. [2023-11-17 15:11:43,411 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2023-11-17 15:11:43,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 1121 events. 667/1121 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5310 event pairs, 69 based on Foata normal form. 14/1135 useless extension candidates. Maximal degree in co-relation 3354. Up to 676 conditions per place. [2023-11-17 15:11:43,417 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 41 selfloop transitions, 2 changer transitions 10/54 dead transitions. [2023-11-17 15:11:43,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 317 flow [2023-11-17 15:11:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:11:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:11:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-11-17 15:11:43,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 15:11:43,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-11-17 15:11:43,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-11-17 15:11:43,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:43,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-11-17 15:11:43,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,422 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 98 flow. Second operand 4 states and 454 transitions. [2023-11-17 15:11:43,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 317 flow [2023-11-17 15:11:43,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 302 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 15:11:43,428 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 105 flow [2023-11-17 15:11:43,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-11-17 15:11:43,430 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-11-17 15:11:43,430 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 105 flow [2023-11-17 15:11:43,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:43,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:43,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:11:43,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:43,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1564973773, now seen corresponding path program 2 times [2023-11-17 15:11:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589046342] [2023-11-17 15:11:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:43,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589046342] [2023-11-17 15:11:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589046342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:43,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:11:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39516875] [2023-11-17 15:11:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:11:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:11:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:11:43,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 227 [2023-11-17 15:11:43,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:43,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 227 [2023-11-17 15:11:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:43,763 INFO L124 PetriNetUnfolderBase]: 341/635 cut-off events. [2023-11-17 15:11:43,764 INFO L125 PetriNetUnfolderBase]: For 332/333 co-relation queries the response was YES. [2023-11-17 15:11:43,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 635 events. 341/635 cut-off events. For 332/333 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3040 event pairs, 83 based on Foata normal form. 66/687 useless extension candidates. Maximal degree in co-relation 1820. Up to 238 conditions per place. [2023-11-17 15:11:43,766 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 38 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2023-11-17 15:11:43,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 389 flow [2023-11-17 15:11:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:11:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:11:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-11-17 15:11:43,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49045521292217326 [2023-11-17 15:11:43,768 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-11-17 15:11:43,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-11-17 15:11:43,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:43,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-11-17 15:11:43,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,771 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 105 flow. Second operand 6 states and 668 transitions. [2023-11-17 15:11:43,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 389 flow [2023-11-17 15:11:43,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:11:43,774 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 160 flow [2023-11-17 15:11:43,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-11-17 15:11:43,774 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-11-17 15:11:43,774 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 160 flow [2023-11-17 15:11:43,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:43,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:43,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:11:43,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:43,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash -663954153, now seen corresponding path program 1 times [2023-11-17 15:11:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999556092] [2023-11-17 15:11:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999556092] [2023-11-17 15:11:43,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999556092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:43,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:43,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:11:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068459456] [2023-11-17 15:11:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:43,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:11:43,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:43,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:11:43,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:11:43,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 227 [2023-11-17 15:11:43,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:43,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:43,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 227 [2023-11-17 15:11:43,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:44,025 INFO L124 PetriNetUnfolderBase]: 224/434 cut-off events. [2023-11-17 15:11:44,025 INFO L125 PetriNetUnfolderBase]: For 511/512 co-relation queries the response was YES. [2023-11-17 15:11:44,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 434 events. 224/434 cut-off events. For 511/512 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1891 event pairs, 78 based on Foata normal form. 19/440 useless extension candidates. Maximal degree in co-relation 1396. Up to 158 conditions per place. [2023-11-17 15:11:44,027 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 33 selfloop transitions, 10 changer transitions 14/60 dead transitions. [2023-11-17 15:11:44,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 380 flow [2023-11-17 15:11:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:11:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:11:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2023-11-17 15:11:44,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4770295783511643 [2023-11-17 15:11:44,029 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2023-11-17 15:11:44,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2023-11-17 15:11:44,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:44,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2023-11-17 15:11:44,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,033 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,033 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 160 flow. Second operand 7 states and 758 transitions. [2023-11-17 15:11:44,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 380 flow [2023-11-17 15:11:44,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 326 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-17 15:11:44,036 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 144 flow [2023-11-17 15:11:44,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-11-17 15:11:44,037 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-11-17 15:11:44,037 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 144 flow [2023-11-17 15:11:44,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:44,038 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] [2023-11-17 15:11:44,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:11:44,038 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:44,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1259460949, now seen corresponding path program 1 times [2023-11-17 15:11:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494455205] [2023-11-17 15:11:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494455205] [2023-11-17 15:11:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494455205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:11:44,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486808379] [2023-11-17 15:11:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:44,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:11:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:11:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:11:44,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2023-11-17 15:11:44,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:44,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2023-11-17 15:11:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:44,279 INFO L124 PetriNetUnfolderBase]: 249/480 cut-off events. [2023-11-17 15:11:44,279 INFO L125 PetriNetUnfolderBase]: For 625/625 co-relation queries the response was YES. [2023-11-17 15:11:44,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 480 events. 249/480 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2265 event pairs, 37 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 1426. Up to 297 conditions per place. [2023-11-17 15:11:44,281 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 27 selfloop transitions, 1 changer transitions 27/57 dead transitions. [2023-11-17 15:11:44,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 414 flow [2023-11-17 15:11:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:11:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:11:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-11-17 15:11:44,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 15:11:44,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-11-17 15:11:44,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-11-17 15:11:44,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:44,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-11-17 15:11:44,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,285 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,285 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 144 flow. Second operand 4 states and 454 transitions. [2023-11-17 15:11:44,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 414 flow [2023-11-17 15:11:44,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 332 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-11-17 15:11:44,287 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 111 flow [2023-11-17 15:11:44,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-11-17 15:11:44,288 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-17 15:11:44,288 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 111 flow [2023-11-17 15:11:44,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:44,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:44,288 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] [2023-11-17 15:11:44,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:11:44,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:44,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -866919213, now seen corresponding path program 2 times [2023-11-17 15:11:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:44,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602935797] [2023-11-17 15:11:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:11:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:11:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:11:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602935797] [2023-11-17 15:11:45,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602935797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:11:45,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:11:45,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:11:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350175001] [2023-11-17 15:11:45,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:11:45,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:11:45,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:11:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:11:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:11:45,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 227 [2023-11-17 15:11:45,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:45,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:11:45,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 227 [2023-11-17 15:11:45,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:11:45,461 INFO L124 PetriNetUnfolderBase]: 226/462 cut-off events. [2023-11-17 15:11:45,462 INFO L125 PetriNetUnfolderBase]: For 439/440 co-relation queries the response was YES. [2023-11-17 15:11:45,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 462 events. 226/462 cut-off events. For 439/440 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2045 event pairs, 72 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 1335. Up to 135 conditions per place. [2023-11-17 15:11:45,463 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 22 selfloop transitions, 4 changer transitions 52/81 dead transitions. [2023-11-17 15:11:45,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 521 flow [2023-11-17 15:11:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:11:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:11:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 920 transitions. [2023-11-17 15:11:45,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503181595692609 [2023-11-17 15:11:45,466 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 920 transitions. [2023-11-17 15:11:45,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 920 transitions. [2023-11-17 15:11:45,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:11:45,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 920 transitions. [2023-11-17 15:11:45,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:45,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:45,472 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:45,473 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 111 flow. Second operand 9 states and 920 transitions. [2023-11-17 15:11:45,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 521 flow [2023-11-17 15:11:45,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 512 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:11:45,476 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 124 flow [2023-11-17 15:11:45,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=124, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-11-17 15:11:45,477 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-11-17 15:11:45,478 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 124 flow [2023-11-17 15:11:45,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:11:45,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:11:45,478 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] [2023-11-17 15:11:45,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:11:45,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:11:45,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:11:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1894173465, now seen corresponding path program 3 times [2023-11-17 15:11:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:11:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117920669] [2023-11-17 15:11:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:11:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:11:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:11:45,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:11:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:11:45,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:11:45,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:11:45,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:11:45,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:11:45,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:11:45,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:11:45,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:11:45,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:11:45,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:11:45,594 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 15:11:45,598 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:11:45,598 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:11:45,653 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:11:45,654 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:11:45,654 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:11:45,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:11:45 BasicIcfg [2023-11-17 15:11:45,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:11:45,668 INFO L158 Benchmark]: Toolchain (without parser) took 9804.55ms. Allocated memory was 203.4MB in the beginning and 361.8MB in the end (delta: 158.3MB). Free memory was 153.3MB in the beginning and 207.5MB in the end (delta: -54.2MB). Peak memory consumption was 103.5MB. Max. memory is 8.0GB. [2023-11-17 15:11:45,668 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory was 123.1MB in the beginning and 123.0MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:11:45,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.08ms. Allocated memory is still 203.4MB. Free memory was 153.3MB in the beginning and 129.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:11:45,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.74ms. Allocated memory is still 203.4MB. Free memory was 129.2MB in the beginning and 126.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:11:45,668 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 203.4MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:11:45,669 INFO L158 Benchmark]: RCFGBuilder took 636.57ms. Allocated memory is still 203.4MB. Free memory was 124.3MB in the beginning and 150.5MB in the end (delta: -26.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:11:45,669 INFO L158 Benchmark]: TraceAbstraction took 8547.33ms. Allocated memory was 203.4MB in the beginning and 361.8MB in the end (delta: 158.3MB). Free memory was 149.9MB in the beginning and 207.5MB in the end (delta: -57.6MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. [2023-11-17 15:11:45,670 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.11ms. Allocated memory is still 168.8MB. Free memory was 123.1MB in the beginning and 123.0MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.08ms. Allocated memory is still 203.4MB. Free memory was 153.3MB in the beginning and 129.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.74ms. Allocated memory is still 203.4MB. Free memory was 129.2MB in the beginning and 126.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 203.4MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 636.57ms. Allocated memory is still 203.4MB. Free memory was 124.3MB in the beginning and 150.5MB in the end (delta: -26.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8547.33ms. Allocated memory was 203.4MB in the beginning and 361.8MB in the end (delta: 158.3MB). Free memory was 149.9MB in the beginning and 207.5MB in the end (delta: -57.6MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 125 PlacesBefore, 34 PlacesAfterwards, 117 TransitionsBefore, 25 TransitionsAfterwards, 2530 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 5992 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3335, independent: 3144, independent conditional: 0, independent unconditional: 3144, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1881, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1881, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3335, independent: 1314, independent conditional: 0, independent unconditional: 1314, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1881, unknown conditional: 0, unknown unconditional: 1881] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 x = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L777] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 692 IncrementalHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 5 mSDtfsCounter, 692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=7, InterpolantAutomatonStates: 47, 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, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:11:45,688 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...