/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:16:29,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:16:29,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:16:29,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:16:29,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:16:29,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:16:29,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:16:29,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:16:29,240 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:16:29,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:16:29,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:16:29,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:16:29,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:16:29,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:16:29,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:16:29,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:16:29,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:16:29,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:16:29,243 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:16:29,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:16:29,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:16:29,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:16:29,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:16:29,245 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:16:29,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:16:29,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:16:29,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:16:29,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:16:29,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:16:29,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:16:29,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:16:29,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:16:29,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:16:29,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:16:29,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:16:29,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:16:29,509 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:16:29,509 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:16:29,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-11-17 15:16:30,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:16:30,931 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:16:30,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-11-17 15:16:30,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03755291c/1469c24ef72c4a57a369347619badeb6/FLAG93f97fab4 [2023-11-17 15:16:30,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03755291c/1469c24ef72c4a57a369347619badeb6 [2023-11-17 15:16:30,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:16:30,968 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:16:30,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:16:30,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:16:30,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:16:30,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:30" (1/1) ... [2023-11-17 15:16:30,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a93fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:30, skipping insertion in model container [2023-11-17 15:16:30,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:30" (1/1) ... [2023-11-17 15:16:31,030 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:16:31,153 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/mix055_tso.oepc.i[949,962] [2023-11-17 15:16:31,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:16:31,378 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:16:31,392 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/mix055_tso.oepc.i[949,962] [2023-11-17 15:16:31,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:16:31,485 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:16:31,485 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:16:31,492 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:16:31,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31 WrapperNode [2023-11-17 15:16:31,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:16:31,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:16:31,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:16:31,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:16:31,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,565 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-17 15:16:31,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:16:31,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:16:31,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:16:31,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:16:31,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:16:31,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:16:31,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:16:31,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:16:31,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (1/1) ... [2023-11-17 15:16:31,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:16:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:16:31,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:16:31,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:16:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:16:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:16:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:16:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:16:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:16:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:16:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:16:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:16:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:16:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:16:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:16:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:16:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:16:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:16:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:16:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:16:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:16:31,696 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:16:31,853 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:16:31,854 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:16:32,217 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:16:32,391 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:16:32,391 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:16:32,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:16:32 BoogieIcfgContainer [2023-11-17 15:16:32,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:16:32,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:16:32,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:16:32,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:16:32,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:16:30" (1/3) ... [2023-11-17 15:16:32,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d18ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:32, skipping insertion in model container [2023-11-17 15:16:32,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:31" (2/3) ... [2023-11-17 15:16:32,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d18ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:32, skipping insertion in model container [2023-11-17 15:16:32,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:16:32" (3/3) ... [2023-11-17 15:16:32,402 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-11-17 15:16:32,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:16:32,418 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:16:32,419 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:16:32,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:16:32,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 132 transitions, 280 flow [2023-11-17 15:16:32,613 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-17 15:16:32,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:32,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-17 15:16:32,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 132 transitions, 280 flow [2023-11-17 15:16:32,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 128 transitions, 268 flow [2023-11-17 15:16:32,632 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:16:32,650 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 128 transitions, 268 flow [2023-11-17 15:16:32,654 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 128 transitions, 268 flow [2023-11-17 15:16:32,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 128 transitions, 268 flow [2023-11-17 15:16:32,702 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-17 15:16:32,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:32,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-17 15:16:32,707 INFO L119 LiptonReduction]: Number of co-enabled transitions 3416 [2023-11-17 15:16:36,834 INFO L134 LiptonReduction]: Checked pairs total: 8299 [2023-11-17 15:16:36,834 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-17 15:16:36,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:16:36,864 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;@5b79ecb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:16:36,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:16:36,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:16:36,873 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 15:16:36,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:36,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:36,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:16:36,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:36,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash 534869474, now seen corresponding path program 1 times [2023-11-17 15:16:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168530032] [2023-11-17 15:16:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:36,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168530032] [2023-11-17 15:16:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168530032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:37,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:16:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026491247] [2023-11-17 15:16:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:37,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:16:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:37,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:16:37,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:16:37,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 245 [2023-11-17 15:16:37,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:37,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:37,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 245 [2023-11-17 15:16:37,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:38,193 INFO L124 PetriNetUnfolderBase]: 4695/6858 cut-off events. [2023-11-17 15:16:38,194 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-17 15:16:38,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13434 conditions, 6858 events. 4695/6858 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 39822 event pairs, 861 based on Foata normal form. 0/6585 useless extension candidates. Maximal degree in co-relation 13422. Up to 5107 conditions per place. [2023-11-17 15:16:38,245 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-17 15:16:38,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 198 flow [2023-11-17 15:16:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:16:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:16:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-11-17 15:16:38,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319727891156463 [2023-11-17 15:16:38,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-11-17 15:16:38,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-11-17 15:16:38,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:38,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-11-17 15:16:38,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:38,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:38,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:38,274 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 391 transitions. [2023-11-17 15:16:38,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 198 flow [2023-11-17 15:16:38,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:38,279 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-17 15:16:38,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-17 15:16:38,288 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-17 15:16:38,288 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-17 15:16:38,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:38,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:38,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:38,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:16:38,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:38,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1915142619, now seen corresponding path program 1 times [2023-11-17 15:16:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155605995] [2023-11-17 15:16:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:38,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155605995] [2023-11-17 15:16:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155605995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:39,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958150961] [2023-11-17 15:16:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:39,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:39,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:39,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:39,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-11-17 15:16:39,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:39,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:39,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-11-17 15:16:39,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:41,084 INFO L124 PetriNetUnfolderBase]: 12377/16718 cut-off events. [2023-11-17 15:16:41,084 INFO L125 PetriNetUnfolderBase]: For 803/803 co-relation queries the response was YES. [2023-11-17 15:16:41,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34573 conditions, 16718 events. 12377/16718 cut-off events. For 803/803 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 84005 event pairs, 1547 based on Foata normal form. 713/17431 useless extension candidates. Maximal degree in co-relation 34563. Up to 12844 conditions per place. [2023-11-17 15:16:41,254 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 58 selfloop transitions, 10 changer transitions 42/110 dead transitions. [2023-11-17 15:16:41,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 110 transitions, 474 flow [2023-11-17 15:16:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-11-17 15:16:41,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46997084548104956 [2023-11-17 15:16:41,260 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-11-17 15:16:41,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-11-17 15:16:41,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:41,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-11-17 15:16:41,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,268 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,269 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 7 states and 806 transitions. [2023-11-17 15:16:41,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 110 transitions, 474 flow [2023-11-17 15:16:41,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 110 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:41,272 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 158 flow [2023-11-17 15:16:41,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-17 15:16:41,273 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-11-17 15:16:41,273 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 158 flow [2023-11-17 15:16:41,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:41,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:41,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:16:41,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:41,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -760105031, now seen corresponding path program 1 times [2023-11-17 15:16:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025461259] [2023-11-17 15:16:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:41,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:41,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 15:16:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025461259] [2023-11-17 15:16:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025461259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:41,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485892555] [2023-11-17 15:16:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:41,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:41,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:41,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 245 [2023-11-17 15:16:41,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:41,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 245 [2023-11-17 15:16:41,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:43,822 INFO L124 PetriNetUnfolderBase]: 13901/18773 cut-off events. [2023-11-17 15:16:43,823 INFO L125 PetriNetUnfolderBase]: For 17031/17031 co-relation queries the response was YES. [2023-11-17 15:16:43,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58742 conditions, 18773 events. 13901/18773 cut-off events. For 17031/17031 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 92408 event pairs, 2058 based on Foata normal form. 687/19460 useless extension candidates. Maximal degree in co-relation 58727. Up to 13936 conditions per place. [2023-11-17 15:16:44,051 INFO L140 encePairwiseOnDemand]: 232/245 looper letters, 63 selfloop transitions, 22 changer transitions 42/127 dead transitions. [2023-11-17 15:16:44,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 127 transitions, 799 flow [2023-11-17 15:16:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 792 transitions. [2023-11-17 15:16:44,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618075801749271 [2023-11-17 15:16:44,055 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 792 transitions. [2023-11-17 15:16:44,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 792 transitions. [2023-11-17 15:16:44,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:44,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 792 transitions. [2023-11-17 15:16:44,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.14285714285714) internal successors, (792), 7 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,062 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 158 flow. Second operand 7 states and 792 transitions. [2023-11-17 15:16:44,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 127 transitions, 799 flow [2023-11-17 15:16:44,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 127 transitions, 776 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:44,099 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 367 flow [2023-11-17 15:16:44,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2023-11-17 15:16:44,100 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-11-17 15:16:44,100 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 367 flow [2023-11-17 15:16:44,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:44,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:44,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:16:44,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:44,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1741475318, now seen corresponding path program 1 times [2023-11-17 15:16:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863588624] [2023-11-17 15:16:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:44,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863588624] [2023-11-17 15:16:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863588624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096380107] [2023-11-17 15:16:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:44,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:44,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 245 [2023-11-17 15:16:44,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:44,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 245 [2023-11-17 15:16:44,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:47,082 INFO L124 PetriNetUnfolderBase]: 14545/19646 cut-off events. [2023-11-17 15:16:47,083 INFO L125 PetriNetUnfolderBase]: For 51851/51851 co-relation queries the response was YES. [2023-11-17 15:16:47,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80815 conditions, 19646 events. 14545/19646 cut-off events. For 51851/51851 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 100467 event pairs, 1772 based on Foata normal form. 662/20308 useless extension candidates. Maximal degree in co-relation 80795. Up to 14337 conditions per place. [2023-11-17 15:16:47,297 INFO L140 encePairwiseOnDemand]: 232/245 looper letters, 105 selfloop transitions, 47 changer transitions 57/209 dead transitions. [2023-11-17 15:16:47,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 209 transitions, 1767 flow [2023-11-17 15:16:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:16:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:16:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 912 transitions. [2023-11-17 15:16:47,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46530612244897956 [2023-11-17 15:16:47,300 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 912 transitions. [2023-11-17 15:16:47,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 912 transitions. [2023-11-17 15:16:47,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:47,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 912 transitions. [2023-11-17 15:16:47,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,307 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,308 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 367 flow. Second operand 8 states and 912 transitions. [2023-11-17 15:16:47,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 209 transitions, 1767 flow [2023-11-17 15:16:47,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 209 transitions, 1763 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:47,401 INFO L231 Difference]: Finished difference. Result has 61 places, 94 transitions, 893 flow [2023-11-17 15:16:47,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=893, PETRI_PLACES=61, PETRI_TRANSITIONS=94} [2023-11-17 15:16:47,403 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-11-17 15:16:47,404 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 94 transitions, 893 flow [2023-11-17 15:16:47,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:47,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:47,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:16:47,405 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:47,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -716649967, now seen corresponding path program 1 times [2023-11-17 15:16:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567729394] [2023-11-17 15:16:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567729394] [2023-11-17 15:16:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567729394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:47,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991733458] [2023-11-17 15:16:47,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:47,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:16:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:16:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:16:48,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2023-11-17 15:16:48,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 94 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:48,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:48,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2023-11-17 15:16:48,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:49,858 INFO L124 PetriNetUnfolderBase]: 11620/16227 cut-off events. [2023-11-17 15:16:49,858 INFO L125 PetriNetUnfolderBase]: For 102388/102983 co-relation queries the response was YES. [2023-11-17 15:16:49,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90230 conditions, 16227 events. 11620/16227 cut-off events. For 102388/102983 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 90439 event pairs, 1399 based on Foata normal form. 739/16671 useless extension candidates. Maximal degree in co-relation 90205. Up to 10990 conditions per place. [2023-11-17 15:16:50,043 INFO L140 encePairwiseOnDemand]: 237/245 looper letters, 113 selfloop transitions, 20 changer transitions 40/191 dead transitions. [2023-11-17 15:16:50,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 191 transitions, 2155 flow [2023-11-17 15:16:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-11-17 15:16:50,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892128279883382 [2023-11-17 15:16:50,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-11-17 15:16:50,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-11-17 15:16:50,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:50,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-11-17 15:16:50,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,054 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,055 INFO L175 Difference]: Start difference. First operand has 61 places, 94 transitions, 893 flow. Second operand 7 states and 839 transitions. [2023-11-17 15:16:50,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 191 transitions, 2155 flow [2023-11-17 15:16:50,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 191 transitions, 2021 flow, removed 65 selfloop flow, removed 3 redundant places. [2023-11-17 15:16:50,196 INFO L231 Difference]: Finished difference. Result has 65 places, 108 transitions, 1093 flow [2023-11-17 15:16:50,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1093, PETRI_PLACES=65, PETRI_TRANSITIONS=108} [2023-11-17 15:16:50,198 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-11-17 15:16:50,198 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 108 transitions, 1093 flow [2023-11-17 15:16:50,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:50,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:50,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:16:50,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:50,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1139881895, now seen corresponding path program 1 times [2023-11-17 15:16:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497882887] [2023-11-17 15:16:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497882887] [2023-11-17 15:16:51,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497882887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:51,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:51,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:51,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522950781] [2023-11-17 15:16:51,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:51,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:51,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:51,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-11-17 15:16:51,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 108 transitions, 1093 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:51,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:51,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-11-17 15:16:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:53,151 INFO L124 PetriNetUnfolderBase]: 11661/16207 cut-off events. [2023-11-17 15:16:53,151 INFO L125 PetriNetUnfolderBase]: For 115730/116508 co-relation queries the response was YES. [2023-11-17 15:16:53,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91818 conditions, 16207 events. 11661/16207 cut-off events. For 115730/116508 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 88964 event pairs, 1413 based on Foata normal form. 788/16631 useless extension candidates. Maximal degree in co-relation 91790. Up to 11172 conditions per place. [2023-11-17 15:16:53,369 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 118 selfloop transitions, 22 changer transitions 34/192 dead transitions. [2023-11-17 15:16:53,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 192 transitions, 2229 flow [2023-11-17 15:16:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2023-11-17 15:16:53,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845481049562682 [2023-11-17 15:16:53,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2023-11-17 15:16:53,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2023-11-17 15:16:53,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:53,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2023-11-17 15:16:53,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,379 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,379 INFO L175 Difference]: Start difference. First operand has 65 places, 108 transitions, 1093 flow. Second operand 7 states and 831 transitions. [2023-11-17 15:16:53,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 192 transitions, 2229 flow [2023-11-17 15:16:53,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 192 transitions, 2126 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:53,835 INFO L231 Difference]: Finished difference. Result has 68 places, 114 transitions, 1220 flow [2023-11-17 15:16:53,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1220, PETRI_PLACES=68, PETRI_TRANSITIONS=114} [2023-11-17 15:16:53,837 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-11-17 15:16:53,837 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 114 transitions, 1220 flow [2023-11-17 15:16:53,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:53,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:53,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:16:53,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:53,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -741325403, now seen corresponding path program 1 times [2023-11-17 15:16:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473619727] [2023-11-17 15:16:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:54,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473619727] [2023-11-17 15:16:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473619727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:54,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499046204] [2023-11-17 15:16:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:54,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:54,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2023-11-17 15:16:54,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 114 transitions, 1220 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:54,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:54,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2023-11-17 15:16:54,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:56,211 INFO L124 PetriNetUnfolderBase]: 12588/17431 cut-off events. [2023-11-17 15:16:56,212 INFO L125 PetriNetUnfolderBase]: For 141685/142617 co-relation queries the response was YES. [2023-11-17 15:16:56,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101248 conditions, 17431 events. 12588/17431 cut-off events. For 141685/142617 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 95315 event pairs, 1760 based on Foata normal form. 911/18057 useless extension candidates. Maximal degree in co-relation 101218. Up to 11659 conditions per place. [2023-11-17 15:16:56,362 INFO L140 encePairwiseOnDemand]: 235/245 looper letters, 131 selfloop transitions, 40 changer transitions 27/216 dead transitions. [2023-11-17 15:16:56,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 216 transitions, 2583 flow [2023-11-17 15:16:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-11-17 15:16:56,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915451895043732 [2023-11-17 15:16:56,366 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-11-17 15:16:56,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-11-17 15:16:56,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:56,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-11-17 15:16:56,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,371 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,371 INFO L175 Difference]: Start difference. First operand has 68 places, 114 transitions, 1220 flow. Second operand 7 states and 843 transitions. [2023-11-17 15:16:56,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 216 transitions, 2583 flow [2023-11-17 15:16:56,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 216 transitions, 2498 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:56,557 INFO L231 Difference]: Finished difference. Result has 70 places, 132 transitions, 1556 flow [2023-11-17 15:16:56,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1556, PETRI_PLACES=70, PETRI_TRANSITIONS=132} [2023-11-17 15:16:56,557 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-11-17 15:16:56,560 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 132 transitions, 1556 flow [2023-11-17 15:16:56,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:56,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:56,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:16:56,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:56,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash -741296573, now seen corresponding path program 2 times [2023-11-17 15:16:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691774290] [2023-11-17 15:16:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691774290] [2023-11-17 15:16:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691774290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248762151] [2023-11-17 15:16:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:56,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2023-11-17 15:16:56,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 132 transitions, 1556 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:56,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2023-11-17 15:16:56,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:59,204 INFO L124 PetriNetUnfolderBase]: 12868/17824 cut-off events. [2023-11-17 15:16:59,204 INFO L125 PetriNetUnfolderBase]: For 172432/173383 co-relation queries the response was YES. [2023-11-17 15:16:59,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111453 conditions, 17824 events. 12868/17824 cut-off events. For 172432/173383 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 97876 event pairs, 1792 based on Foata normal form. 912/18449 useless extension candidates. Maximal degree in co-relation 111422. Up to 11866 conditions per place. [2023-11-17 15:16:59,399 INFO L140 encePairwiseOnDemand]: 235/245 looper letters, 142 selfloop transitions, 50 changer transitions 27/237 dead transitions. [2023-11-17 15:16:59,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 237 transitions, 3206 flow [2023-11-17 15:16:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-11-17 15:16:59,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915451895043732 [2023-11-17 15:16:59,406 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-11-17 15:16:59,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-11-17 15:16:59,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:59,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-11-17 15:16:59,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:59,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:59,413 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:59,413 INFO L175 Difference]: Start difference. First operand has 70 places, 132 transitions, 1556 flow. Second operand 7 states and 843 transitions. [2023-11-17 15:16:59,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 237 transitions, 3206 flow [2023-11-17 15:16:59,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 237 transitions, 3036 flow, removed 44 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:59,559 INFO L231 Difference]: Finished difference. Result has 74 places, 160 transitions, 2081 flow [2023-11-17 15:16:59,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2081, PETRI_PLACES=74, PETRI_TRANSITIONS=160} [2023-11-17 15:16:59,561 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-11-17 15:16:59,562 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 160 transitions, 2081 flow [2023-11-17 15:16:59,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:59,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:59,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:59,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:16:59,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:59,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -663542063, now seen corresponding path program 3 times [2023-11-17 15:16:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900252067] [2023-11-17 15:16:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:59,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:59,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900252067] [2023-11-17 15:16:59,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900252067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:59,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:59,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890669658] [2023-11-17 15:16:59,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:59,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:59,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-11-17 15:16:59,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 160 transitions, 2081 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:59,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:59,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-11-17 15:16:59,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:02,795 INFO L124 PetriNetUnfolderBase]: 15187/21007 cut-off events. [2023-11-17 15:17:02,796 INFO L125 PetriNetUnfolderBase]: For 304992/307152 co-relation queries the response was YES. [2023-11-17 15:17:02,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146317 conditions, 21007 events. 15187/21007 cut-off events. For 304992/307152 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 119135 event pairs, 1427 based on Foata normal form. 1551/22016 useless extension candidates. Maximal degree in co-relation 146283. Up to 12357 conditions per place. [2023-11-17 15:17:02,968 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 142 selfloop transitions, 66 changer transitions 42/268 dead transitions. [2023-11-17 15:17:02,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 268 transitions, 3914 flow [2023-11-17 15:17:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:17:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:17:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1061 transitions. [2023-11-17 15:17:02,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811791383219955 [2023-11-17 15:17:02,972 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1061 transitions. [2023-11-17 15:17:02,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1061 transitions. [2023-11-17 15:17:02,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:02,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1061 transitions. [2023-11-17 15:17:02,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:02,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:02,978 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:02,978 INFO L175 Difference]: Start difference. First operand has 74 places, 160 transitions, 2081 flow. Second operand 9 states and 1061 transitions. [2023-11-17 15:17:02,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 268 transitions, 3914 flow [2023-11-17 15:17:03,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 268 transitions, 3713 flow, removed 84 selfloop flow, removed 3 redundant places. [2023-11-17 15:17:03,374 INFO L231 Difference]: Finished difference. Result has 82 places, 168 transitions, 2379 flow [2023-11-17 15:17:03,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2379, PETRI_PLACES=82, PETRI_TRANSITIONS=168} [2023-11-17 15:17:03,375 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-11-17 15:17:03,375 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 168 transitions, 2379 flow [2023-11-17 15:17:03,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:03,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:03,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:03,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:17:03,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:03,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash -919308117, now seen corresponding path program 1 times [2023-11-17 15:17:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279658271] [2023-11-17 15:17:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:03,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279658271] [2023-11-17 15:17:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279658271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:03,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:03,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:17:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717745383] [2023-11-17 15:17:03,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:03,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:03,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:03,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-11-17 15:17:03,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 168 transitions, 2379 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:03,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:03,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-11-17 15:17:03,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:04,964 INFO L124 PetriNetUnfolderBase]: 8159/11434 cut-off events. [2023-11-17 15:17:04,965 INFO L125 PetriNetUnfolderBase]: For 244452/249869 co-relation queries the response was YES. [2023-11-17 15:17:05,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87298 conditions, 11434 events. 8159/11434 cut-off events. For 244452/249869 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 61760 event pairs, 1433 based on Foata normal form. 1204/12186 useless extension candidates. Maximal degree in co-relation 87260. Up to 8397 conditions per place. [2023-11-17 15:17:05,052 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 223 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2023-11-17 15:17:05,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 249 transitions, 4025 flow [2023-11-17 15:17:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-11-17 15:17:05,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507482993197279 [2023-11-17 15:17:05,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-11-17 15:17:05,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-11-17 15:17:05,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:05,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-11-17 15:17:05,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:05,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:05,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:05,056 INFO L175 Difference]: Start difference. First operand has 82 places, 168 transitions, 2379 flow. Second operand 3 states and 373 transitions. [2023-11-17 15:17:05,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 249 transitions, 4025 flow [2023-11-17 15:17:05,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 249 transitions, 3856 flow, removed 81 selfloop flow, removed 6 redundant places. [2023-11-17 15:17:05,155 INFO L231 Difference]: Finished difference. Result has 76 places, 168 transitions, 2252 flow [2023-11-17 15:17:05,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2252, PETRI_PLACES=76, PETRI_TRANSITIONS=168} [2023-11-17 15:17:05,156 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-11-17 15:17:05,156 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 168 transitions, 2252 flow [2023-11-17 15:17:05,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:05,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:05,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:05,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:17:05,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:05,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash -163594935, now seen corresponding path program 1 times [2023-11-17 15:17:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653484871] [2023-11-17 15:17:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653484871] [2023-11-17 15:17:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653484871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054441442] [2023-11-17 15:17:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:05,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:05,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-11-17 15:17:05,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 168 transitions, 2252 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:05,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:05,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-11-17 15:17:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:06,074 INFO L124 PetriNetUnfolderBase]: 4110/6022 cut-off events. [2023-11-17 15:17:06,074 INFO L125 PetriNetUnfolderBase]: For 94255/96536 co-relation queries the response was YES. [2023-11-17 15:17:06,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43027 conditions, 6022 events. 4110/6022 cut-off events. For 94255/96536 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 31661 event pairs, 611 based on Foata normal form. 877/6691 useless extension candidates. Maximal degree in co-relation 42992. Up to 3532 conditions per place. [2023-11-17 15:17:06,120 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 242 selfloop transitions, 9 changer transitions 0/272 dead transitions. [2023-11-17 15:17:06,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 272 transitions, 4204 flow [2023-11-17 15:17:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:17:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:17:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-11-17 15:17:06,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091836734693878 [2023-11-17 15:17:06,122 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-11-17 15:17:06,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-11-17 15:17:06,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:06,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-11-17 15:17:06,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:06,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:06,125 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:06,125 INFO L175 Difference]: Start difference. First operand has 76 places, 168 transitions, 2252 flow. Second operand 4 states and 499 transitions. [2023-11-17 15:17:06,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 272 transitions, 4204 flow [2023-11-17 15:17:06,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 272 transitions, 4199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:17:06,180 INFO L231 Difference]: Finished difference. Result has 79 places, 150 transitions, 1952 flow [2023-11-17 15:17:06,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1952, PETRI_PLACES=79, PETRI_TRANSITIONS=150} [2023-11-17 15:17:06,180 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-11-17 15:17:06,181 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 150 transitions, 1952 flow [2023-11-17 15:17:06,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:06,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:06,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:06,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:17:06,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:06,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1549026706, now seen corresponding path program 1 times [2023-11-17 15:17:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437887870] [2023-11-17 15:17:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437887870] [2023-11-17 15:17:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437887870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:06,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631059547] [2023-11-17 15:17:06,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:06,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:06,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:06,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 245 [2023-11-17 15:17:06,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 150 transitions, 1952 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:06,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:06,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 245 [2023-11-17 15:17:06,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:07,747 INFO L124 PetriNetUnfolderBase]: 6913/10241 cut-off events. [2023-11-17 15:17:07,747 INFO L125 PetriNetUnfolderBase]: For 107343/107343 co-relation queries the response was YES. [2023-11-17 15:17:07,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70284 conditions, 10241 events. 6913/10241 cut-off events. For 107343/107343 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 55655 event pairs, 948 based on Foata normal form. 130/10371 useless extension candidates. Maximal degree in co-relation 70247. Up to 5365 conditions per place. [2023-11-17 15:17:07,803 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 180 selfloop transitions, 17 changer transitions 80/277 dead transitions. [2023-11-17 15:17:07,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 277 transitions, 4124 flow [2023-11-17 15:17:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:17:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:17:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions. [2023-11-17 15:17:07,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4598639455782313 [2023-11-17 15:17:07,805 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 676 transitions. [2023-11-17 15:17:07,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions. [2023-11-17 15:17:07,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:07,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions. [2023-11-17 15:17:07,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:07,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:07,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:07,809 INFO L175 Difference]: Start difference. First operand has 79 places, 150 transitions, 1952 flow. Second operand 6 states and 676 transitions. [2023-11-17 15:17:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 277 transitions, 4124 flow [2023-11-17 15:17:07,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 277 transitions, 4090 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:07,895 INFO L231 Difference]: Finished difference. Result has 86 places, 139 transitions, 1828 flow [2023-11-17 15:17:07,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1828, PETRI_PLACES=86, PETRI_TRANSITIONS=139} [2023-11-17 15:17:07,896 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-11-17 15:17:07,896 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 139 transitions, 1828 flow [2023-11-17 15:17:07,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:07,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:07,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:07,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:17:07,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:07,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1562833265, now seen corresponding path program 1 times [2023-11-17 15:17:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420466382] [2023-11-17 15:17:07,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:08,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420466382] [2023-11-17 15:17:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420466382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510744792] [2023-11-17 15:17:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:08,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:08,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-11-17 15:17:08,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 139 transitions, 1828 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:08,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:08,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-11-17 15:17:08,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:08,973 INFO L124 PetriNetUnfolderBase]: 4004/5922 cut-off events. [2023-11-17 15:17:08,973 INFO L125 PetriNetUnfolderBase]: For 97766/99743 co-relation queries the response was YES. [2023-11-17 15:17:08,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43442 conditions, 5922 events. 4004/5922 cut-off events. For 97766/99743 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 32492 event pairs, 458 based on Foata normal form. 733/6477 useless extension candidates. Maximal degree in co-relation 43401. Up to 3541 conditions per place. [2023-11-17 15:17:09,005 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 204 selfloop transitions, 13 changer transitions 28/263 dead transitions. [2023-11-17 15:17:09,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 263 transitions, 4132 flow [2023-11-17 15:17:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-11-17 15:17:09,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2023-11-17 15:17:09,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-11-17 15:17:09,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-11-17 15:17:09,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:09,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-11-17 15:17:09,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:09,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:09,010 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:09,010 INFO L175 Difference]: Start difference. First operand has 86 places, 139 transitions, 1828 flow. Second operand 5 states and 623 transitions. [2023-11-17 15:17:09,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 263 transitions, 4132 flow [2023-11-17 15:17:09,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 263 transitions, 3905 flow, removed 33 selfloop flow, removed 8 redundant places. [2023-11-17 15:17:09,082 INFO L231 Difference]: Finished difference. Result has 81 places, 129 transitions, 1579 flow [2023-11-17 15:17:09,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1579, PETRI_PLACES=81, PETRI_TRANSITIONS=129} [2023-11-17 15:17:09,083 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-11-17 15:17:09,083 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 129 transitions, 1579 flow [2023-11-17 15:17:09,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:09,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:09,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:09,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:17:09,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:09,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1096305934, now seen corresponding path program 1 times [2023-11-17 15:17:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651176546] [2023-11-17 15:17:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651176546] [2023-11-17 15:17:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651176546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:17:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122836785] [2023-11-17 15:17:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:09,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:17:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:17:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:17:09,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2023-11-17 15:17:09,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 129 transitions, 1579 flow. Second operand has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:09,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:09,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2023-11-17 15:17:09,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:10,711 INFO L124 PetriNetUnfolderBase]: 6319/9653 cut-off events. [2023-11-17 15:17:10,711 INFO L125 PetriNetUnfolderBase]: For 108883/109283 co-relation queries the response was YES. [2023-11-17 15:17:10,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68784 conditions, 9653 events. 6319/9653 cut-off events. For 108883/109283 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 58142 event pairs, 323 based on Foata normal form. 146/9722 useless extension candidates. Maximal degree in co-relation 68746. Up to 5500 conditions per place. [2023-11-17 15:17:10,767 INFO L140 encePairwiseOnDemand]: 235/245 looper letters, 190 selfloop transitions, 26 changer transitions 147/373 dead transitions. [2023-11-17 15:17:10,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 373 transitions, 5111 flow [2023-11-17 15:17:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:17:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:17:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1178 transitions. [2023-11-17 15:17:10,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48081632653061224 [2023-11-17 15:17:10,770 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1178 transitions. [2023-11-17 15:17:10,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1178 transitions. [2023-11-17 15:17:10,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:10,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1178 transitions. [2023-11-17 15:17:10,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:10,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:10,776 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:10,776 INFO L175 Difference]: Start difference. First operand has 81 places, 129 transitions, 1579 flow. Second operand 10 states and 1178 transitions. [2023-11-17 15:17:10,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 373 transitions, 5111 flow [2023-11-17 15:17:10,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 373 transitions, 4919 flow, removed 46 selfloop flow, removed 3 redundant places. [2023-11-17 15:17:10,975 INFO L231 Difference]: Finished difference. Result has 93 places, 129 transitions, 1654 flow [2023-11-17 15:17:10,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1654, PETRI_PLACES=93, PETRI_TRANSITIONS=129} [2023-11-17 15:17:10,976 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2023-11-17 15:17:10,976 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 129 transitions, 1654 flow [2023-11-17 15:17:10,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:10,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:10,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:10,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:17:10,977 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:10,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1723240254, now seen corresponding path program 2 times [2023-11-17 15:17:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937048777] [2023-11-17 15:17:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937048777] [2023-11-17 15:17:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937048777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:11,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:11,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:17:11,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694512271] [2023-11-17 15:17:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:11,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:17:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:17:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:17:11,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-11-17 15:17:11,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 129 transitions, 1654 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:11,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:11,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-11-17 15:17:11,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:12,152 INFO L124 PetriNetUnfolderBase]: 4628/6855 cut-off events. [2023-11-17 15:17:12,152 INFO L125 PetriNetUnfolderBase]: For 116410/118374 co-relation queries the response was YES. [2023-11-17 15:17:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51477 conditions, 6855 events. 4628/6855 cut-off events. For 116410/118374 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 39823 event pairs, 383 based on Foata normal form. 641/7299 useless extension candidates. Maximal degree in co-relation 51439. Up to 4011 conditions per place. [2023-11-17 15:17:12,207 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 146 selfloop transitions, 17 changer transitions 86/261 dead transitions. [2023-11-17 15:17:12,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 261 transitions, 4050 flow [2023-11-17 15:17:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:17:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:17:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-11-17 15:17:12,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863945578231295 [2023-11-17 15:17:12,210 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-11-17 15:17:12,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-11-17 15:17:12,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:12,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-11-17 15:17:12,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:12,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:12,215 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:12,215 INFO L175 Difference]: Start difference. First operand has 93 places, 129 transitions, 1654 flow. Second operand 6 states and 733 transitions. [2023-11-17 15:17:12,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 261 transitions, 4050 flow [2023-11-17 15:17:12,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 261 transitions, 3772 flow, removed 98 selfloop flow, removed 5 redundant places. [2023-11-17 15:17:12,508 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 1037 flow [2023-11-17 15:17:12,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1037, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-11-17 15:17:12,509 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2023-11-17 15:17:12,509 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 1037 flow [2023-11-17 15:17:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:12,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:12,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:12,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:17:12,510 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:12,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1750974782, now seen corresponding path program 1 times [2023-11-17 15:17:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:12,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055514057] [2023-11-17 15:17:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055514057] [2023-11-17 15:17:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055514057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885395488] [2023-11-17 15:17:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:12,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:12,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:12,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2023-11-17 15:17:12,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 1037 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:12,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:12,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2023-11-17 15:17:12,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:13,396 INFO L124 PetriNetUnfolderBase]: 2606/4064 cut-off events. [2023-11-17 15:17:13,396 INFO L125 PetriNetUnfolderBase]: For 49160/49365 co-relation queries the response was YES. [2023-11-17 15:17:13,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27600 conditions, 4064 events. 2606/4064 cut-off events. For 49160/49365 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21927 event pairs, 394 based on Foata normal form. 138/4188 useless extension candidates. Maximal degree in co-relation 27560. Up to 1940 conditions per place. [2023-11-17 15:17:13,424 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 55 selfloop transitions, 1 changer transitions 92/152 dead transitions. [2023-11-17 15:17:13,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 152 transitions, 2000 flow [2023-11-17 15:17:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-11-17 15:17:13,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-11-17 15:17:13,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-11-17 15:17:13,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-11-17 15:17:13,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:13,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-11-17 15:17:13,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:13,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:13,432 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:13,432 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 1037 flow. Second operand 5 states and 595 transitions. [2023-11-17 15:17:13,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 152 transitions, 2000 flow [2023-11-17 15:17:13,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 152 transitions, 1627 flow, removed 146 selfloop flow, removed 13 redundant places. [2023-11-17 15:17:13,597 INFO L231 Difference]: Finished difference. Result has 84 places, 56 transitions, 434 flow [2023-11-17 15:17:13,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=84, PETRI_TRANSITIONS=56} [2023-11-17 15:17:13,597 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-11-17 15:17:13,598 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 56 transitions, 434 flow [2023-11-17 15:17:13,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:13,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:13,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:13,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 15:17:13,598 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:13,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash 228274442, now seen corresponding path program 2 times [2023-11-17 15:17:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:13,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203072035] [2023-11-17 15:17:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203072035] [2023-11-17 15:17:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203072035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:15,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:15,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 15:17:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407854414] [2023-11-17 15:17:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:15,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 15:17:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 15:17:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-17 15:17:15,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-11-17 15:17:15,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 56 transitions, 434 flow. Second operand has 11 states, 11 states have (on average 101.27272727272727) internal successors, (1114), 11 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:15,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:15,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-11-17 15:17:15,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:15,598 INFO L124 PetriNetUnfolderBase]: 1279/2073 cut-off events. [2023-11-17 15:17:15,598 INFO L125 PetriNetUnfolderBase]: For 8438/8479 co-relation queries the response was YES. [2023-11-17 15:17:15,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9978 conditions, 2073 events. 1279/2073 cut-off events. For 8438/8479 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10087 event pairs, 248 based on Foata normal form. 34/2076 useless extension candidates. Maximal degree in co-relation 9947. Up to 775 conditions per place. [2023-11-17 15:17:15,608 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 76 selfloop transitions, 8 changer transitions 54/141 dead transitions. [2023-11-17 15:17:15,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 141 transitions, 1270 flow [2023-11-17 15:17:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:17:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:17:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-11-17 15:17:15,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2023-11-17 15:17:15,610 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-11-17 15:17:15,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-11-17 15:17:15,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:15,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-11-17 15:17:15,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:15,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:15,614 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:15,614 INFO L175 Difference]: Start difference. First operand has 84 places, 56 transitions, 434 flow. Second operand 7 states and 770 transitions. [2023-11-17 15:17:15,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 141 transitions, 1270 flow [2023-11-17 15:17:15,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 141 transitions, 1188 flow, removed 25 selfloop flow, removed 14 redundant places. [2023-11-17 15:17:15,642 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 414 flow [2023-11-17 15:17:15,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2023-11-17 15:17:15,643 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-11-17 15:17:15,643 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 414 flow [2023-11-17 15:17:15,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.27272727272727) internal successors, (1114), 11 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:15,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:15,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:15,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 15:17:15,644 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:17:15,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -727987270, now seen corresponding path program 3 times [2023-11-17 15:17:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991393393] [2023-11-17 15:17:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:17:15,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:17:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:17:15,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:17:15,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:17:15,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:17:15,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:17:15,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:17:15,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:17:15,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:17:15,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:17:15,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:17:15,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 15:17:15,794 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:15,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:17:15,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:17:15,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 15:17:15,853 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:17:15,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:17:15,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:17:15,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:17:15 BasicIcfg [2023-11-17 15:17:15,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:17:15,885 INFO L158 Benchmark]: Toolchain (without parser) took 44918.07ms. Allocated memory was 173.0MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 136.1MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-11-17 15:17:15,886 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 173.0MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:17:15,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.10ms. Allocated memory is still 173.0MB. Free memory was 135.8MB in the beginning and 111.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:15,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.06ms. Allocated memory is still 173.0MB. Free memory was 111.6MB in the beginning and 108.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:15,886 INFO L158 Benchmark]: Boogie Preprocessor took 47.90ms. Allocated memory is still 173.0MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:15,887 INFO L158 Benchmark]: RCFGBuilder took 778.66ms. Allocated memory is still 173.0MB. Free memory was 106.8MB in the beginning and 127.3MB in the end (delta: -20.5MB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. [2023-11-17 15:17:15,887 INFO L158 Benchmark]: TraceAbstraction took 43489.82ms. Allocated memory was 173.0MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 126.8MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-11-17 15:17:15,888 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.17ms. Allocated memory is still 173.0MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.10ms. Allocated memory is still 173.0MB. Free memory was 135.8MB in the beginning and 111.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.06ms. Allocated memory is still 173.0MB. Free memory was 111.6MB in the beginning and 108.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.90ms. Allocated memory is still 173.0MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 778.66ms. Allocated memory is still 173.0MB. Free memory was 106.8MB in the beginning and 127.3MB in the end (delta: -20.5MB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. * TraceAbstraction took 43489.82ms. Allocated memory was 173.0MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 126.8MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 1.6GB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 138 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3416 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 8299 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4041, independent: 3854, independent conditional: 0, independent unconditional: 3854, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2395, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2395, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4041, independent: 1515, independent conditional: 0, independent unconditional: 1515, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 2395, unknown conditional: 0, unknown unconditional: 2395] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, t1482={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L784] 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) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 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 [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L754] 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) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 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 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L804] 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) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 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 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] - 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 820 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2840 IncrementalHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 49 mSDtfsCounter, 2840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2379occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:17:15,905 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...