/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:24:52,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:24:52,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:24:52,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:24:52,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:24:52,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:24:52,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:24:52,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:24:52,892 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:24:52,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:24:52,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:24:52,896 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:24:52,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:24:52,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:24:52,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:24:52,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:24:52,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:24:52,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:24:52,898 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:24:52,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:24:52,899 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:24:52,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:24:52,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:24:52,900 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:24:52,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:24:52,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:52,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:24:52,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:24:52,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:24:52,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:24:52,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:24:52,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:24:52,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:24:53,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:24:53,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:24:53,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:24:53,178 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:24:53,178 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:24:53,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-11-17 11:24:54,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:24:54,701 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:24:54,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-11-17 11:24:54,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64431ca62/0babf9615dbd4a048dec94d2cd67834f/FLAG8b8e9cb28 [2023-11-17 11:24:54,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64431ca62/0babf9615dbd4a048dec94d2cd67834f [2023-11-17 11:24:54,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:24:54,752 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:24:54,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:54,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:24:54,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:24:54,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:54" (1/1) ... [2023-11-17 11:24:54,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c947ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:54, skipping insertion in model container [2023-11-17 11:24:54,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:54" (1/1) ... [2023-11-17 11:24:54,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:24:54,962 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/mix019_tso.oepc.i[949,962] [2023-11-17 11:24:55,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:55,153 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:24:55,166 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/mix019_tso.oepc.i[949,962] [2023-11-17 11:24:55,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:55,233 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:55,234 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:55,240 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:24:55,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55 WrapperNode [2023-11-17 11:24:55,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:55,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:55,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:24:55,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:24:55,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,311 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-11-17 11:24:55,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:55,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:24:55,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:24:55,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:24:55,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:24:55,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:24:55,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:24:55,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:24:55,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (1/1) ... [2023-11-17 11:24:55,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:24:55,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:24:55,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:24:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:24:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:24:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:24:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:24:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:24:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:24:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:24:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:24:55,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:24:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:24:55,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:24:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:24:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:24:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:24:55,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:24:55,451 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:24:55,592 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:24:55,594 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:24:55,924 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:24:56,127 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:24:56,128 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:24:56,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:56 BoogieIcfgContainer [2023-11-17 11:24:56,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:24:56,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:24:56,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:24:56,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:24:56,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:24:54" (1/3) ... [2023-11-17 11:24:56,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4886b5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:56, skipping insertion in model container [2023-11-17 11:24:56,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:55" (2/3) ... [2023-11-17 11:24:56,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4886b5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:56, skipping insertion in model container [2023-11-17 11:24:56,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:56" (3/3) ... [2023-11-17 11:24:56,139 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2023-11-17 11:24:56,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:24:56,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:24:56,156 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:24:56,214 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:24:56,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 94 flow [2023-11-17 11:24:56,274 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2023-11-17 11:24:56,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:56,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 2/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-17 11:24:56,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 41 transitions, 94 flow [2023-11-17 11:24:56,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 38 transitions, 85 flow [2023-11-17 11:24:56,292 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:24:56,309 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 85 flow [2023-11-17 11:24:56,311 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 85 flow [2023-11-17 11:24:56,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 85 flow [2023-11-17 11:24:56,322 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2023-11-17 11:24:56,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:56,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 2/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-17 11:24:56,325 INFO L119 LiptonReduction]: Number of co-enabled transitions 834 [2023-11-17 11:24:58,275 INFO L134 LiptonReduction]: Checked pairs total: 2131 [2023-11-17 11:24:58,275 INFO L136 LiptonReduction]: Total number of compositions: 20 [2023-11-17 11:24:58,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:24:58,294 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;@342cab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:24:58,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:24:58,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:24:58,298 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:24:58,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:58,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:58,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:24:58,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:58,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash 350143457, now seen corresponding path program 1 times [2023-11-17 11:24:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312593981] [2023-11-17 11:24:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312593981] [2023-11-17 11:24:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312593981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774270470] [2023-11-17 11:24:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:58,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:58,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2023-11-17 11:24:58,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:58,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:58,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2023-11-17 11:24:58,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:59,096 INFO L124 PetriNetUnfolderBase]: 711/1177 cut-off events. [2023-11-17 11:24:59,096 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 11:24:59,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1177 events. 711/1177 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6105 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2285. Up to 859 conditions per place. [2023-11-17 11:24:59,109 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 27 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-11-17 11:24:59,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 144 flow [2023-11-17 11:24:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-17 11:24:59,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48633879781420764 [2023-11-17 11:24:59,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-17 11:24:59,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-17 11:24:59,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:59,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-17 11:24:59,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,135 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states and 89 transitions. [2023-11-17 11:24:59,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 144 flow [2023-11-17 11:24:59,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:59,141 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 11:24:59,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, 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 11:24:59,146 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:24:59,147 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 11:24:59,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:59,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:24:59,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:59,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1009660009, now seen corresponding path program 1 times [2023-11-17 11:24:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912004684] [2023-11-17 11:24:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:59,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912004684] [2023-11-17 11:24:59,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912004684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:59,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:59,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:59,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14116390] [2023-11-17 11:24:59,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:59,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:59,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:59,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:59,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:59,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2023-11-17 11:24:59,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:59,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2023-11-17 11:24:59,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:59,951 INFO L124 PetriNetUnfolderBase]: 1269/1880 cut-off events. [2023-11-17 11:24:59,951 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-17 11:24:59,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 1880 events. 1269/1880 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7438 event pairs, 429 based on Foata normal form. 50/1930 useless extension candidates. Maximal degree in co-relation 3936. Up to 1316 conditions per place. [2023-11-17 11:24:59,963 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-17 11:24:59,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 140 flow [2023-11-17 11:24:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2023-11-17 11:24:59,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262295081967213 [2023-11-17 11:24:59,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 78 transitions. [2023-11-17 11:24:59,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 78 transitions. [2023-11-17 11:24:59,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:59,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 78 transitions. [2023-11-17 11:24:59,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,973 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 78 transitions. [2023-11-17 11:24:59,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 140 flow [2023-11-17 11:24:59,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:59,976 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-11-17 11:24:59,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, 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 11:24:59,977 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:24:59,978 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-11-17 11:24:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:59,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:59,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:59,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:24:59,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:24:59,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash -379460452, now seen corresponding path program 1 times [2023-11-17 11:24:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:59,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901711340] [2023-11-17 11:24:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:59,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:00,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901711340] [2023-11-17 11:25:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901711340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105822625] [2023-11-17 11:25:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:00,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:00,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 61 [2023-11-17 11:25:00,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:00,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:00,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 61 [2023-11-17 11:25:00,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:00,582 INFO L124 PetriNetUnfolderBase]: 660/1059 cut-off events. [2023-11-17 11:25:00,582 INFO L125 PetriNetUnfolderBase]: For 58/63 co-relation queries the response was YES. [2023-11-17 11:25:00,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1059 events. 660/1059 cut-off events. For 58/63 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4774 event pairs, 300 based on Foata normal form. 8/1056 useless extension candidates. Maximal degree in co-relation 2172. Up to 946 conditions per place. [2023-11-17 11:25:00,589 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 28 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-11-17 11:25:00,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 148 flow [2023-11-17 11:25:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-17 11:25:00,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46994535519125685 [2023-11-17 11:25:00,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-17 11:25:00,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-17 11:25:00,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:00,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-17 11:25:00,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:00,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:00,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:00,595 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 86 transitions. [2023-11-17 11:25:00,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 148 flow [2023-11-17 11:25:00,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:00,596 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 73 flow [2023-11-17 11:25:00,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-11-17 11:25:00,597 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-11-17 11:25:00,597 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 73 flow [2023-11-17 11:25:00,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:00,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:00,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:25:00,598 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:00,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1121651418, now seen corresponding path program 1 times [2023-11-17 11:25:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122048240] [2023-11-17 11:25:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122048240] [2023-11-17 11:25:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122048240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:01,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:01,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547649717] [2023-11-17 11:25:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:01,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:01,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 61 [2023-11-17 11:25:01,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:01,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:01,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 61 [2023-11-17 11:25:01,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:01,423 INFO L124 PetriNetUnfolderBase]: 713/1160 cut-off events. [2023-11-17 11:25:01,423 INFO L125 PetriNetUnfolderBase]: For 248/259 co-relation queries the response was YES. [2023-11-17 11:25:01,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1160 events. 713/1160 cut-off events. For 248/259 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5635 event pairs, 170 based on Foata normal form. 14/1165 useless extension candidates. Maximal degree in co-relation 2593. Up to 919 conditions per place. [2023-11-17 11:25:01,431 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 41 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2023-11-17 11:25:01,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 241 flow [2023-11-17 11:25:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2023-11-17 11:25:01,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46557377049180326 [2023-11-17 11:25:01,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 142 transitions. [2023-11-17 11:25:01,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 142 transitions. [2023-11-17 11:25:01,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:01,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 142 transitions. [2023-11-17 11:25:01,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:01,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:01,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:01,435 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 73 flow. Second operand 5 states and 142 transitions. [2023-11-17 11:25:01,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 241 flow [2023-11-17 11:25:01,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:01,437 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 124 flow [2023-11-17 11:25:01,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-17 11:25:01,438 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-11-17 11:25:01,438 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 124 flow [2023-11-17 11:25:01,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:01,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:01,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:01,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:25:01,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:01,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1872276660, now seen corresponding path program 1 times [2023-11-17 11:25:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:01,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120340531] [2023-11-17 11:25:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:01,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120340531] [2023-11-17 11:25:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120340531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259566700] [2023-11-17 11:25:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:01,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:01,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:01,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2023-11-17 11:25:01,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:01,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:01,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2023-11-17 11:25:01,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:02,299 INFO L124 PetriNetUnfolderBase]: 1447/2144 cut-off events. [2023-11-17 11:25:02,299 INFO L125 PetriNetUnfolderBase]: For 1624/1624 co-relation queries the response was YES. [2023-11-17 11:25:02,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2144 events. 1447/2144 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9053 event pairs, 371 based on Foata normal form. 16/2160 useless extension candidates. Maximal degree in co-relation 5888. Up to 1797 conditions per place. [2023-11-17 11:25:02,314 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 54 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2023-11-17 11:25:02,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 379 flow [2023-11-17 11:25:02,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2023-11-17 11:25:02,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4459016393442623 [2023-11-17 11:25:02,316 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2023-11-17 11:25:02,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2023-11-17 11:25:02,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:02,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2023-11-17 11:25:02,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,318 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,319 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 124 flow. Second operand 5 states and 136 transitions. [2023-11-17 11:25:02,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 379 flow [2023-11-17 11:25:02,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:02,324 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 210 flow [2023-11-17 11:25:02,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-11-17 11:25:02,325 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-17 11:25:02,325 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 210 flow [2023-11-17 11:25:02,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:02,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:02,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:25:02,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:02,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:02,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1849212660, now seen corresponding path program 2 times [2023-11-17 11:25:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421317564] [2023-11-17 11:25:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421317564] [2023-11-17 11:25:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421317564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279075346] [2023-11-17 11:25:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:02,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:02,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 61 [2023-11-17 11:25:02,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 61 [2023-11-17 11:25:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:02,896 INFO L124 PetriNetUnfolderBase]: 826/1363 cut-off events. [2023-11-17 11:25:02,896 INFO L125 PetriNetUnfolderBase]: For 2861/2948 co-relation queries the response was YES. [2023-11-17 11:25:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 1363 events. 826/1363 cut-off events. For 2861/2948 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6650 event pairs, 187 based on Foata normal form. 29/1369 useless extension candidates. Maximal degree in co-relation 4458. Up to 988 conditions per place. [2023-11-17 11:25:02,907 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 40 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-11-17 11:25:02,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 364 flow [2023-11-17 11:25:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-11-17 11:25:02,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672131147540984 [2023-11-17 11:25:02,908 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 114 transitions. [2023-11-17 11:25:02,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 114 transitions. [2023-11-17 11:25:02,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:02,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 114 transitions. [2023-11-17 11:25:02,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,910 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,910 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 210 flow. Second operand 4 states and 114 transitions. [2023-11-17 11:25:02,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 364 flow [2023-11-17 11:25:02,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 350 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:02,915 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 230 flow [2023-11-17 11:25:02,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-17 11:25:02,921 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-11-17 11:25:02,922 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 230 flow [2023-11-17 11:25:02,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:02,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:02,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:02,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:25:02,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:02,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2115316012, now seen corresponding path program 1 times [2023-11-17 11:25:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901294115] [2023-11-17 11:25:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:03,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901294115] [2023-11-17 11:25:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901294115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:03,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:03,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113535681] [2023-11-17 11:25:03,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:03,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:03,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:03,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 61 [2023-11-17 11:25:03,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:03,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:03,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 61 [2023-11-17 11:25:03,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:03,675 INFO L124 PetriNetUnfolderBase]: 907/1488 cut-off events. [2023-11-17 11:25:03,675 INFO L125 PetriNetUnfolderBase]: For 4079/4185 co-relation queries the response was YES. [2023-11-17 11:25:03,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 1488 events. 907/1488 cut-off events. For 4079/4185 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7497 event pairs, 168 based on Foata normal form. 55/1519 useless extension candidates. Maximal degree in co-relation 5076. Up to 847 conditions per place. [2023-11-17 11:25:03,689 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 44 selfloop transitions, 22 changer transitions 0/71 dead transitions. [2023-11-17 11:25:03,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 483 flow [2023-11-17 11:25:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2023-11-17 11:25:03,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4721311475409836 [2023-11-17 11:25:03,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 144 transitions. [2023-11-17 11:25:03,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 144 transitions. [2023-11-17 11:25:03,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:03,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 144 transitions. [2023-11-17 11:25:03,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:03,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:03,693 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:03,693 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 230 flow. Second operand 5 states and 144 transitions. [2023-11-17 11:25:03,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 483 flow [2023-11-17 11:25:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 457 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:25:03,698 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 333 flow [2023-11-17 11:25:03,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-17 11:25:03,699 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-17 11:25:03,699 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 333 flow [2023-11-17 11:25:03,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:03,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:03,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:03,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:25:03,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:03,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -884278892, now seen corresponding path program 1 times [2023-11-17 11:25:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531691091] [2023-11-17 11:25:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:04,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531691091] [2023-11-17 11:25:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531691091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729349758] [2023-11-17 11:25:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:04,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:04,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2023-11-17 11:25:04,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:04,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:04,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2023-11-17 11:25:04,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:04,690 INFO L124 PetriNetUnfolderBase]: 2144/3222 cut-off events. [2023-11-17 11:25:04,690 INFO L125 PetriNetUnfolderBase]: For 8671/8671 co-relation queries the response was YES. [2023-11-17 11:25:04,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11768 conditions, 3222 events. 2144/3222 cut-off events. For 8671/8671 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15330 event pairs, 487 based on Foata normal form. 44/3266 useless extension candidates. Maximal degree in co-relation 11746. Up to 1894 conditions per place. [2023-11-17 11:25:04,714 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 81 selfloop transitions, 14 changer transitions 24/119 dead transitions. [2023-11-17 11:25:04,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 119 transitions, 1041 flow [2023-11-17 11:25:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2023-11-17 11:25:04,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180327868852459 [2023-11-17 11:25:04,716 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 153 transitions. [2023-11-17 11:25:04,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 153 transitions. [2023-11-17 11:25:04,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:04,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 153 transitions. [2023-11-17 11:25:04,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:04,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:04,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:04,718 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 333 flow. Second operand 6 states and 153 transitions. [2023-11-17 11:25:04,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 119 transitions, 1041 flow [2023-11-17 11:25:04,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 1002 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:04,730 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 464 flow [2023-11-17 11:25:04,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-11-17 11:25:04,731 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-11-17 11:25:04,731 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 464 flow [2023-11-17 11:25:04,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:04,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:04,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:04,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:25:04,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:04,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 127733765, now seen corresponding path program 1 times [2023-11-17 11:25:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336899627] [2023-11-17 11:25:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336899627] [2023-11-17 11:25:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336899627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680682922] [2023-11-17 11:25:04,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:04,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:04,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2023-11-17 11:25:04,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 464 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:04,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:04,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2023-11-17 11:25:04,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:05,403 INFO L124 PetriNetUnfolderBase]: 2363/3735 cut-off events. [2023-11-17 11:25:05,403 INFO L125 PetriNetUnfolderBase]: For 14855/14972 co-relation queries the response was YES. [2023-11-17 11:25:05,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14353 conditions, 3735 events. 2363/3735 cut-off events. For 14855/14972 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20713 event pairs, 397 based on Foata normal form. 157/3882 useless extension candidates. Maximal degree in co-relation 14326. Up to 1880 conditions per place. [2023-11-17 11:25:05,438 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 81 selfloop transitions, 2 changer transitions 13/102 dead transitions. [2023-11-17 11:25:05,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 102 transitions, 996 flow [2023-11-17 11:25:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2023-11-17 11:25:05,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262295081967213 [2023-11-17 11:25:05,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 104 transitions. [2023-11-17 11:25:05,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 104 transitions. [2023-11-17 11:25:05,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:05,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 104 transitions. [2023-11-17 11:25:05,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:05,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:05,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:05,442 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 464 flow. Second operand 4 states and 104 transitions. [2023-11-17 11:25:05,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 102 transitions, 996 flow [2023-11-17 11:25:05,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 980 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-11-17 11:25:05,461 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 460 flow [2023-11-17 11:25:05,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=460, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-11-17 11:25:05,462 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-11-17 11:25:05,462 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 460 flow [2023-11-17 11:25:05,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:05,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:05,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:25:05,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:05,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1710077151, now seen corresponding path program 2 times [2023-11-17 11:25:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437626052] [2023-11-17 11:25:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437626052] [2023-11-17 11:25:05,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437626052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:05,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:05,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060134349] [2023-11-17 11:25:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:05,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:05,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2023-11-17 11:25:05,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:05,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:05,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2023-11-17 11:25:05,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:05,984 INFO L124 PetriNetUnfolderBase]: 1355/2444 cut-off events. [2023-11-17 11:25:05,984 INFO L125 PetriNetUnfolderBase]: For 9806/9972 co-relation queries the response was YES. [2023-11-17 11:25:05,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9329 conditions, 2444 events. 1355/2444 cut-off events. For 9806/9972 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15754 event pairs, 195 based on Foata normal form. 339/2737 useless extension candidates. Maximal degree in co-relation 9299. Up to 956 conditions per place. [2023-11-17 11:25:06,001 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 69 selfloop transitions, 5 changer transitions 6/92 dead transitions. [2023-11-17 11:25:06,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 833 flow [2023-11-17 11:25:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2023-11-17 11:25:06,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42213114754098363 [2023-11-17 11:25:06,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 103 transitions. [2023-11-17 11:25:06,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 103 transitions. [2023-11-17 11:25:06,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:06,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 103 transitions. [2023-11-17 11:25:06,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,004 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 460 flow. Second operand 4 states and 103 transitions. [2023-11-17 11:25:06,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 833 flow [2023-11-17 11:25:06,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:06,013 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 429 flow [2023-11-17 11:25:06,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-11-17 11:25:06,014 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2023-11-17 11:25:06,014 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 429 flow [2023-11-17 11:25:06,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:06,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:06,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:25:06,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:06,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1848950076, now seen corresponding path program 1 times [2023-11-17 11:25:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110838732] [2023-11-17 11:25:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110838732] [2023-11-17 11:25:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110838732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:06,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:06,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:06,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673664122] [2023-11-17 11:25:06,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:06,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:06,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2023-11-17 11:25:06,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:06,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2023-11-17 11:25:06,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:06,520 INFO L124 PetriNetUnfolderBase]: 1037/1934 cut-off events. [2023-11-17 11:25:06,520 INFO L125 PetriNetUnfolderBase]: For 7804/7956 co-relation queries the response was YES. [2023-11-17 11:25:06,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8259 conditions, 1934 events. 1037/1934 cut-off events. For 7804/7956 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12259 event pairs, 170 based on Foata normal form. 206/2105 useless extension candidates. Maximal degree in co-relation 8226. Up to 764 conditions per place. [2023-11-17 11:25:06,533 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 67 selfloop transitions, 8 changer transitions 8/93 dead transitions. [2023-11-17 11:25:06,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 835 flow [2023-11-17 11:25:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2023-11-17 11:25:06,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262295081967213 [2023-11-17 11:25:06,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 130 transitions. [2023-11-17 11:25:06,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 130 transitions. [2023-11-17 11:25:06,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:06,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 130 transitions. [2023-11-17 11:25:06,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,538 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 429 flow. Second operand 5 states and 130 transitions. [2023-11-17 11:25:06,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 835 flow [2023-11-17 11:25:06,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 777 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-17 11:25:06,555 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 406 flow [2023-11-17 11:25:06,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-11-17 11:25:06,556 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2023-11-17 11:25:06,556 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 406 flow [2023-11-17 11:25:06,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:06,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:06,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:25:06,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:06,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1391236164, now seen corresponding path program 1 times [2023-11-17 11:25:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450623362] [2023-11-17 11:25:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:06,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:06,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450623362] [2023-11-17 11:25:06,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450623362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:06,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:06,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:25:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18683572] [2023-11-17 11:25:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:06,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:06,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2023-11-17 11:25:06,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:06,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:06,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2023-11-17 11:25:06,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:07,070 INFO L124 PetriNetUnfolderBase]: 988/1827 cut-off events. [2023-11-17 11:25:07,071 INFO L125 PetriNetUnfolderBase]: For 6629/6781 co-relation queries the response was YES. [2023-11-17 11:25:07,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 1827 events. 988/1827 cut-off events. For 6629/6781 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11454 event pairs, 165 based on Foata normal form. 89/1882 useless extension candidates. Maximal degree in co-relation 8017. Up to 762 conditions per place. [2023-11-17 11:25:07,085 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 32 selfloop transitions, 11 changer transitions 34/82 dead transitions. [2023-11-17 11:25:07,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 729 flow [2023-11-17 11:25:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2023-11-17 11:25:07,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3743169398907104 [2023-11-17 11:25:07,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 137 transitions. [2023-11-17 11:25:07,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 137 transitions. [2023-11-17 11:25:07,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:07,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 137 transitions. [2023-11-17 11:25:07,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:07,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:07,088 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:07,088 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 406 flow. Second operand 6 states and 137 transitions. [2023-11-17 11:25:07,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 729 flow [2023-11-17 11:25:07,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 677 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-17 11:25:07,095 INFO L231 Difference]: Finished difference. Result has 70 places, 37 transitions, 271 flow [2023-11-17 11:25:07,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=70, PETRI_TRANSITIONS=37} [2023-11-17 11:25:07,096 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2023-11-17 11:25:07,096 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 37 transitions, 271 flow [2023-11-17 11:25:07,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:07,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:07,097 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 11:25:07,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:25:07,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:07,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash -927837180, now seen corresponding path program 1 times [2023-11-17 11:25:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:07,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874712978] [2023-11-17 11:25:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:25:07,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:25:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:25:07,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:25:07,225 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:25:07,226 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:25:07,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:25:07,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:25:07,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:25:07,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:25:07,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:25:07,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:25:07,229 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:07,234 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:25:07,235 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:25:07,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:25:07,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:25:07,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:25:07,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:25:07 BasicIcfg [2023-11-17 11:25:07,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:25:07,326 INFO L158 Benchmark]: Toolchain (without parser) took 12574.78ms. Allocated memory was 187.7MB in the beginning and 621.8MB in the end (delta: 434.1MB). Free memory was 142.9MB in the beginning and 515.2MB in the end (delta: -372.3MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2023-11-17 11:25:07,326 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:25:07,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.53ms. Allocated memory is still 187.7MB. Free memory was 142.5MB in the beginning and 119.1MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:25:07,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.13ms. Allocated memory is still 187.7MB. Free memory was 119.1MB in the beginning and 116.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:25:07,327 INFO L158 Benchmark]: Boogie Preprocessor took 49.15ms. Allocated memory is still 187.7MB. Free memory was 116.3MB in the beginning and 114.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:25:07,327 INFO L158 Benchmark]: RCFGBuilder took 767.76ms. Allocated memory is still 187.7MB. Free memory was 114.6MB in the beginning and 127.0MB in the end (delta: -12.4MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2023-11-17 11:25:07,328 INFO L158 Benchmark]: TraceAbstraction took 11193.45ms. Allocated memory was 187.7MB in the beginning and 621.8MB in the end (delta: 434.1MB). Free memory was 126.4MB in the beginning and 515.2MB in the end (delta: -388.7MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. [2023-11-17 11:25:07,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.53ms. Allocated memory is still 187.7MB. Free memory was 142.5MB in the beginning and 119.1MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.13ms. Allocated memory is still 187.7MB. Free memory was 119.1MB in the beginning and 116.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.15ms. Allocated memory is still 187.7MB. Free memory was 116.3MB in the beginning and 114.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 767.76ms. Allocated memory is still 187.7MB. Free memory was 114.6MB in the beginning and 127.0MB in the end (delta: -12.4MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11193.45ms. Allocated memory was 187.7MB in the beginning and 621.8MB in the end (delta: 434.1MB). Free memory was 126.4MB in the beginning and 515.2MB in the end (delta: -388.7MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 46 PlacesBefore, 34 PlacesAfterwards, 38 TransitionsBefore, 24 TransitionsAfterwards, 834 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 20 TotalNumberOfCompositions, 2131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 822, independent: 729, independent conditional: 0, independent unconditional: 729, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 518, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 518, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 618, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 614, dependent conditional: 0, dependent unconditional: 614, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 822, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 518, unknown conditional: 0, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 826]: 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: 828]: 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, 66 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: 11.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 24 mSDtfsCounter, 807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=464occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:25:07,355 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...