/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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:19:51,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:19:51,836 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:19:51,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:19:51,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:19:51,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:19:51,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:19:51,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:19:51,869 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:19:51,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:19:51,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:19:51,870 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:19:51,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:19:51,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:19:51,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:19:51,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:19:51,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:19:51,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:19:51,875 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:19:51,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:19:51,875 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:19:51,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:19:51,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:19:51,879 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:19:51,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:19:51,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:19:51,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:19:51,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:19:51,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:19:51,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:19:51,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:19:51,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:19:51,881 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:19:52,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:19:52,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:19:52,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:19:52,117 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:19:52,118 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:19:52,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:19:53,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:19:53,539 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:19:53,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:19:53,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cf1d4d7/85fa5ab25e3e4534b9d42f0106e83d23/FLAG90c05f70e [2023-11-17 15:19:53,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cf1d4d7/85fa5ab25e3e4534b9d42f0106e83d23 [2023-11-17 15:19:53,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:19:53,571 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:19:53,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:19:53,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:19:53,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:19:53,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:53" (1/1) ... [2023-11-17 15:19:53,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243cf96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:53, skipping insertion in model container [2023-11-17 15:19:53,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:53" (1/1) ... [2023-11-17 15:19:53,626 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:19:53,770 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 15:19:53,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:19:54,004 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:19:54,017 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 15:19:54,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:19:54,128 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:19:54,129 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:19:54,135 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:19:54,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54 WrapperNode [2023-11-17 15:19:54,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:19:54,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:19:54,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:19:54,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:19:54,146 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:19:54" (1/1) ... [2023-11-17 15:19:54,173 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:19:54" (1/1) ... [2023-11-17 15:19:54,208 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-17 15:19:54,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:19:54,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:19:54,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:19:54,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:19:54,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:19:54,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:19:54,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:19:54,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:19:54,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (1/1) ... [2023-11-17 15:19:54,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:19:54,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:19:54,320 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:19:54,346 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:19:54,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:19:54,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:19:54,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:19:54,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:19:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:19:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:19:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:19:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:19:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:19:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:19:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:19:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:19:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:19:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:19:54,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:19:54,358 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:19:54,512 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:19:54,514 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:19:54,899 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:19:55,094 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:19:55,094 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:19:55,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:55 BoogieIcfgContainer [2023-11-17 15:19:55,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:19:55,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:19:55,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:19:55,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:19:55,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:19:53" (1/3) ... [2023-11-17 15:19:55,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0141ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:55, skipping insertion in model container [2023-11-17 15:19:55,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:54" (2/3) ... [2023-11-17 15:19:55,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0141ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:55, skipping insertion in model container [2023-11-17 15:19:55,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:55" (3/3) ... [2023-11-17 15:19:55,105 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:19:55,123 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:19:55,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:19:55,123 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:19:55,180 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:19:55,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 236 flow [2023-11-17 15:19:55,327 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-17 15:19:55,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-17 15:19:55,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 236 flow [2023-11-17 15:19:55,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-11-17 15:19:55,346 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:19:55,367 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-17 15:19:55,371 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-17 15:19:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-11-17 15:19:55,412 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-17 15:19:55,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:55,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-17 15:19:55,416 INFO L119 LiptonReduction]: Number of co-enabled transitions 2304 [2023-11-17 15:19:59,800 INFO L134 LiptonReduction]: Checked pairs total: 5181 [2023-11-17 15:19:59,800 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-11-17 15:19:59,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:19:59,830 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;@41fc584f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:19:59,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:19:59,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:19:59,836 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 15:19:59,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:59,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:59,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:59,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:59,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1446189453, now seen corresponding path program 1 times [2023-11-17 15:19:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788776006] [2023-11-17 15:19:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:00,292 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:20:00,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:00,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788776006] [2023-11-17 15:20:00,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788776006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:20:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849691793] [2023-11-17 15:20:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:00,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:20:00,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:00,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:20:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:20:00,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 209 [2023-11-17 15:20:00,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:20:00,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:00,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 209 [2023-11-17 15:20:00,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:00,742 INFO L124 PetriNetUnfolderBase]: 1331/2108 cut-off events. [2023-11-17 15:20:00,742 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-17 15:20:00,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 2108 events. 1331/2108 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10056 event pairs, 287 based on Foata normal form. 0/2012 useless extension candidates. Maximal degree in co-relation 4124. Up to 1477 conditions per place. [2023-11-17 15:20:00,756 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 31 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-17 15:20:00,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 151 flow [2023-11-17 15:20:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:20:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:20:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-11-17 15:20:00,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5199362041467305 [2023-11-17 15:20:00,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-11-17 15:20:00,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-11-17 15:20:00,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:00,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-11-17 15:20:00,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:20:00,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:20:00,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:20:00,784 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 326 transitions. [2023-11-17 15:20:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 151 flow [2023-11-17 15:20:00,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:20:00,791 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 15:20:00,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 15:20:00,796 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 15:20:00,796 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 15:20:00,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:20:00,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:00,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:00,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:20:00,798 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:00,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash 614972866, now seen corresponding path program 1 times [2023-11-17 15:20:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420043304] [2023-11-17 15:20:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:01,336 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:20:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420043304] [2023-11-17 15:20:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420043304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:20:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935121784] [2023-11-17 15:20:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:01,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:20:01,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:01,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:20:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:20:01,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2023-11-17 15:20:01,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have 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:20:01,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:01,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2023-11-17 15:20:01,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:01,892 INFO L124 PetriNetUnfolderBase]: 1463/2192 cut-off events. [2023-11-17 15:20:01,892 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-17 15:20:01,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 2192 events. 1463/2192 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9527 event pairs, 460 based on Foata normal form. 132/2324 useless extension candidates. Maximal degree in co-relation 4556. Up to 1094 conditions per place. [2023-11-17 15:20:01,901 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 34 selfloop transitions, 8 changer transitions 27/69 dead transitions. [2023-11-17 15:20:01,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 294 flow [2023-11-17 15:20:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:20:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:20:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 639 transitions. [2023-11-17 15:20:01,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43677375256322626 [2023-11-17 15:20:01,908 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 639 transitions. [2023-11-17 15:20:01,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 639 transitions. [2023-11-17 15:20:01,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:01,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 639 transitions. [2023-11-17 15:20:01,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have 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:20:01,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have 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:20:01,917 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have 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:20:01,917 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 7 states and 639 transitions. [2023-11-17 15:20:01,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 294 flow [2023-11-17 15:20:01,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 69 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:20:01,921 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 126 flow [2023-11-17 15:20:01,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-17 15:20:01,921 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-11-17 15:20:01,922 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 126 flow [2023-11-17 15:20:01,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have 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:20:01,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:01,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:01,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:20:01,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:01,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1986156064, now seen corresponding path program 1 times [2023-11-17 15:20:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:01,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491590592] [2023-11-17 15:20:01,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:02,181 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:20:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491590592] [2023-11-17 15:20:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491590592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:20:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284516430] [2023-11-17 15:20:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:20:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:02,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:20:02,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:20:02,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209 [2023-11-17 15:20:02,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have 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:20:02,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:02,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209 [2023-11-17 15:20:02,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:02,540 INFO L124 PetriNetUnfolderBase]: 1257/1907 cut-off events. [2023-11-17 15:20:02,541 INFO L125 PetriNetUnfolderBase]: For 1899/1899 co-relation queries the response was YES. [2023-11-17 15:20:02,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 1907 events. 1257/1907 cut-off events. For 1899/1899 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8227 event pairs, 296 based on Foata normal form. 71/1978 useless extension candidates. Maximal degree in co-relation 5925. Up to 1645 conditions per place. [2023-11-17 15:20:02,553 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 39 selfloop transitions, 4 changer transitions 19/62 dead transitions. [2023-11-17 15:20:02,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 396 flow [2023-11-17 15:20:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:20:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:20:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-11-17 15:20:02,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861244019138756 [2023-11-17 15:20:02,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-11-17 15:20:02,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-11-17 15:20:02,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:02,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-11-17 15:20:02,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:20:02,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have 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:20:02,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have 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:20:02,560 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 126 flow. Second operand 5 states and 508 transitions. [2023-11-17 15:20:02,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 396 flow [2023-11-17 15:20:02,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 389 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:20:02,572 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 166 flow [2023-11-17 15:20:02,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-11-17 15:20:02,574 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-17 15:20:02,574 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 166 flow [2023-11-17 15:20:02,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have 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:20:02,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:02,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:02,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:20:02,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:02,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash 92929991, now seen corresponding path program 1 times [2023-11-17 15:20:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:02,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139988272] [2023-11-17 15:20:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:03,513 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:20:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139988272] [2023-11-17 15:20:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139988272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:20:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631636178] [2023-11-17 15:20:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:03,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:20:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:03,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:20:03,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:20:03,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 209 [2023-11-17 15:20:03,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 166 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have 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:20:03,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:03,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 209 [2023-11-17 15:20:03,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:03,970 INFO L124 PetriNetUnfolderBase]: 1080/1694 cut-off events. [2023-11-17 15:20:03,971 INFO L125 PetriNetUnfolderBase]: For 2737/2737 co-relation queries the response was YES. [2023-11-17 15:20:03,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 1694 events. 1080/1694 cut-off events. For 2737/2737 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7390 event pairs, 69 based on Foata normal form. 53/1747 useless extension candidates. Maximal degree in co-relation 5710. Up to 1186 conditions per place. [2023-11-17 15:20:03,984 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 41 selfloop transitions, 4 changer transitions 15/64 dead transitions. [2023-11-17 15:20:03,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 425 flow [2023-11-17 15:20:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:20:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:20:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-11-17 15:20:03,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585326953748006 [2023-11-17 15:20:03,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-11-17 15:20:03,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-11-17 15:20:03,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:03,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-11-17 15:20:03,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have 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:20:03,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have 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:20:03,991 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have 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:20:03,991 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 166 flow. Second operand 6 states and 575 transitions. [2023-11-17 15:20:03,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 425 flow [2023-11-17 15:20:03,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 413 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 15:20:03,999 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 181 flow [2023-11-17 15:20:03,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-11-17 15:20:04,000 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-11-17 15:20:04,000 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 181 flow [2023-11-17 15:20:04,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have 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:20:04,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:04,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:04,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:20:04,001 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:04,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1440110582, now seen corresponding path program 1 times [2023-11-17 15:20:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229410537] [2023-11-17 15:20:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:04,800 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:20:04,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:04,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229410537] [2023-11-17 15:20:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229410537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:04,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:04,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:20:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863064277] [2023-11-17 15:20:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:04,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:20:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:20:04,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:20:04,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 209 [2023-11-17 15:20:04,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 181 flow. Second operand has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have 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:20:04,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:04,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 209 [2023-11-17 15:20:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:05,440 INFO L124 PetriNetUnfolderBase]: 1288/2012 cut-off events. [2023-11-17 15:20:05,442 INFO L125 PetriNetUnfolderBase]: For 3758/3762 co-relation queries the response was YES. [2023-11-17 15:20:05,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7057 conditions, 2012 events. 1288/2012 cut-off events. For 3758/3762 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9185 event pairs, 119 based on Foata normal form. 60/2072 useless extension candidates. Maximal degree in co-relation 7035. Up to 1270 conditions per place. [2023-11-17 15:20:05,459 INFO L140 encePairwiseOnDemand]: 198/209 looper letters, 64 selfloop transitions, 31 changer transitions 19/118 dead transitions. [2023-11-17 15:20:05,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 118 transitions, 812 flow [2023-11-17 15:20:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 944 transitions. [2023-11-17 15:20:05,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45167464114832534 [2023-11-17 15:20:05,463 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 944 transitions. [2023-11-17 15:20:05,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 944 transitions. [2023-11-17 15:20:05,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:05,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 944 transitions. [2023-11-17 15:20:05,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have 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:20:05,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:05,470 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:05,470 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 181 flow. Second operand 10 states and 944 transitions. [2023-11-17 15:20:05,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 118 transitions, 812 flow [2023-11-17 15:20:05,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 118 transitions, 800 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 15:20:05,504 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 452 flow [2023-11-17 15:20:05,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2023-11-17 15:20:05,506 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-11-17 15:20:05,506 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 452 flow [2023-11-17 15:20:05,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have 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:20:05,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:05,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:05,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:20:05,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:05,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1957558282, now seen corresponding path program 2 times [2023-11-17 15:20:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:05,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469679842] [2023-11-17 15:20:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:06,324 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:20:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469679842] [2023-11-17 15:20:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469679842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693627130] [2023-11-17 15:20:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:06,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:06,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209 [2023-11-17 15:20:06,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 452 flow. Second operand has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have 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:20:06,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:06,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209 [2023-11-17 15:20:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:06,959 INFO L124 PetriNetUnfolderBase]: 1565/2424 cut-off events. [2023-11-17 15:20:06,960 INFO L125 PetriNetUnfolderBase]: For 8642/8673 co-relation queries the response was YES. [2023-11-17 15:20:06,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10901 conditions, 2424 events. 1565/2424 cut-off events. For 8642/8673 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11673 event pairs, 120 based on Foata normal form. 91/2501 useless extension candidates. Maximal degree in co-relation 10873. Up to 1460 conditions per place. [2023-11-17 15:20:06,980 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 67 selfloop transitions, 29 changer transitions 20/120 dead transitions. [2023-11-17 15:20:06,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 120 transitions, 1120 flow [2023-11-17 15:20:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:20:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:20:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 667 transitions. [2023-11-17 15:20:06,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559125085440875 [2023-11-17 15:20:06,983 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 667 transitions. [2023-11-17 15:20:06,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 667 transitions. [2023-11-17 15:20:06,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:06,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 667 transitions. [2023-11-17 15:20:06,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:20:06,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have 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:20:06,987 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have 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:20:06,987 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 452 flow. Second operand 7 states and 667 transitions. [2023-11-17 15:20:06,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 120 transitions, 1120 flow [2023-11-17 15:20:07,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 120 transitions, 1116 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 15:20:07,003 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 693 flow [2023-11-17 15:20:07,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2023-11-17 15:20:07,004 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-11-17 15:20:07,004 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 693 flow [2023-11-17 15:20:07,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have 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:20:07,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:07,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:07,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:20:07,005 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:07,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash 528146088, now seen corresponding path program 3 times [2023-11-17 15:20:07,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:07,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933839111] [2023-11-17 15:20:07,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:07,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:07,854 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:20:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:07,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933839111] [2023-11-17 15:20:07,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933839111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:07,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:07,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:20:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164932406] [2023-11-17 15:20:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:07,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:20:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:20:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:20:07,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209 [2023-11-17 15:20:07,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 693 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have 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:20:07,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:07,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209 [2023-11-17 15:20:07,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:08,613 INFO L124 PetriNetUnfolderBase]: 1652/2587 cut-off events. [2023-11-17 15:20:08,613 INFO L125 PetriNetUnfolderBase]: For 14312/14350 co-relation queries the response was YES. [2023-11-17 15:20:08,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13409 conditions, 2587 events. 1652/2587 cut-off events. For 14312/14350 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12871 event pairs, 66 based on Foata normal form. 102/2671 useless extension candidates. Maximal degree in co-relation 13377. Up to 1289 conditions per place. [2023-11-17 15:20:08,641 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 95 selfloop transitions, 43 changer transitions 19/161 dead transitions. [2023-11-17 15:20:08,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 161 transitions, 1749 flow [2023-11-17 15:20:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 952 transitions. [2023-11-17 15:20:08,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45550239234449763 [2023-11-17 15:20:08,645 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 952 transitions. [2023-11-17 15:20:08,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 952 transitions. [2023-11-17 15:20:08,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:08,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 952 transitions. [2023-11-17 15:20:08,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.2) internal successors, (952), 10 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have 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:20:08,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:08,651 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:08,651 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 693 flow. Second operand 10 states and 952 transitions. [2023-11-17 15:20:08,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 161 transitions, 1749 flow [2023-11-17 15:20:08,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 161 transitions, 1684 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-17 15:20:08,688 INFO L231 Difference]: Finished difference. Result has 71 places, 89 transitions, 942 flow [2023-11-17 15:20:08,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=71, PETRI_TRANSITIONS=89} [2023-11-17 15:20:08,689 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2023-11-17 15:20:08,689 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 942 flow [2023-11-17 15:20:08,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have 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:20:08,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:08,690 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:20:08,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:20:08,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:08,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash -789478482, now seen corresponding path program 1 times [2023-11-17 15:20:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661729839] [2023-11-17 15:20:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:09,743 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:20:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661729839] [2023-11-17 15:20:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661729839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:09,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597610405] [2023-11-17 15:20:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:09,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:09,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209 [2023-11-17 15:20:09,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 942 flow. Second operand has 9 states, 9 states have (on average 87.77777777777777) internal successors, (790), 9 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have 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:20:09,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:09,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209 [2023-11-17 15:20:09,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:10,605 INFO L124 PetriNetUnfolderBase]: 1994/3075 cut-off events. [2023-11-17 15:20:10,606 INFO L125 PetriNetUnfolderBase]: For 21783/21919 co-relation queries the response was YES. [2023-11-17 15:20:10,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17117 conditions, 3075 events. 1994/3075 cut-off events. For 21783/21919 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15593 event pairs, 243 based on Foata normal form. 122/3140 useless extension candidates. Maximal degree in co-relation 17082. Up to 1501 conditions per place. [2023-11-17 15:20:10,646 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 78 selfloop transitions, 46 changer transitions 18/146 dead transitions. [2023-11-17 15:20:10,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 146 transitions, 1781 flow [2023-11-17 15:20:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:20:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:20:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 757 transitions. [2023-11-17 15:20:10,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527511961722488 [2023-11-17 15:20:10,653 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 757 transitions. [2023-11-17 15:20:10,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 757 transitions. [2023-11-17 15:20:10,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:10,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 757 transitions. [2023-11-17 15:20:10,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have 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:20:10,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:10,666 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:10,666 INFO L175 Difference]: Start difference. First operand has 71 places, 89 transitions, 942 flow. Second operand 8 states and 757 transitions. [2023-11-17 15:20:10,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 146 transitions, 1781 flow [2023-11-17 15:20:10,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 146 transitions, 1701 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-11-17 15:20:10,709 INFO L231 Difference]: Finished difference. Result has 77 places, 98 transitions, 1182 flow [2023-11-17 15:20:10,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1182, PETRI_PLACES=77, PETRI_TRANSITIONS=98} [2023-11-17 15:20:10,711 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2023-11-17 15:20:10,711 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 98 transitions, 1182 flow [2023-11-17 15:20:10,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.77777777777777) internal successors, (790), 9 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have 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:20:10,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:10,713 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:20:10,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:20:10,713 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:10,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -363747080, now seen corresponding path program 2 times [2023-11-17 15:20:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676717437] [2023-11-17 15:20:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:11,820 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:20:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676717437] [2023-11-17 15:20:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676717437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:20:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297706763] [2023-11-17 15:20:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:11,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:20:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:20:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:20:11,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 209 [2023-11-17 15:20:11,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 98 transitions, 1182 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 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:20:11,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:11,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 209 [2023-11-17 15:20:11,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:12,825 INFO L124 PetriNetUnfolderBase]: 2713/4079 cut-off events. [2023-11-17 15:20:12,826 INFO L125 PetriNetUnfolderBase]: For 27798/27798 co-relation queries the response was YES. [2023-11-17 15:20:12,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23106 conditions, 4079 events. 2713/4079 cut-off events. For 27798/27798 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20638 event pairs, 156 based on Foata normal form. 48/4127 useless extension candidates. Maximal degree in co-relation 23067. Up to 2349 conditions per place. [2023-11-17 15:20:12,870 INFO L140 encePairwiseOnDemand]: 196/209 looper letters, 98 selfloop transitions, 80 changer transitions 22/200 dead transitions. [2023-11-17 15:20:12,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 200 transitions, 2568 flow [2023-11-17 15:20:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 883 transitions. [2023-11-17 15:20:12,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248803827751197 [2023-11-17 15:20:12,873 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 883 transitions. [2023-11-17 15:20:12,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 883 transitions. [2023-11-17 15:20:12,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:12,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 883 transitions. [2023-11-17 15:20:12,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.3) internal successors, (883), 10 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have 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:20:12,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:12,880 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:12,880 INFO L175 Difference]: Start difference. First operand has 77 places, 98 transitions, 1182 flow. Second operand 10 states and 883 transitions. [2023-11-17 15:20:12,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 200 transitions, 2568 flow [2023-11-17 15:20:12,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 200 transitions, 2535 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-17 15:20:12,938 INFO L231 Difference]: Finished difference. Result has 86 places, 139 transitions, 2053 flow [2023-11-17 15:20:12,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2053, PETRI_PLACES=86, PETRI_TRANSITIONS=139} [2023-11-17 15:20:12,939 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2023-11-17 15:20:12,939 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 139 transitions, 2053 flow [2023-11-17 15:20:12,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 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:20:12,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:12,940 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:20:12,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:20:12,940 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:12,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1391988418, now seen corresponding path program 3 times [2023-11-17 15:20:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:12,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499303834] [2023-11-17 15:20:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:13,819 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:20:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499303834] [2023-11-17 15:20:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499303834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:20:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530024518] [2023-11-17 15:20:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:13,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:20:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:20:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:20:13,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 209 [2023-11-17 15:20:13,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 139 transitions, 2053 flow. Second operand has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have 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:20:13,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:13,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 209 [2023-11-17 15:20:13,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:15,285 INFO L124 PetriNetUnfolderBase]: 3161/4938 cut-off events. [2023-11-17 15:20:15,285 INFO L125 PetriNetUnfolderBase]: For 60514/60843 co-relation queries the response was YES. [2023-11-17 15:20:15,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34600 conditions, 4938 events. 3161/4938 cut-off events. For 60514/60843 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 28443 event pairs, 103 based on Foata normal form. 310/5201 useless extension candidates. Maximal degree in co-relation 34556. Up to 2434 conditions per place. [2023-11-17 15:20:15,336 INFO L140 encePairwiseOnDemand]: 198/209 looper letters, 177 selfloop transitions, 167 changer transitions 18/370 dead transitions. [2023-11-17 15:20:15,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 370 transitions, 5900 flow [2023-11-17 15:20:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 15:20:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 15:20:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1420 transitions. [2023-11-17 15:20:15,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246411483253589 [2023-11-17 15:20:15,341 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1420 transitions. [2023-11-17 15:20:15,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1420 transitions. [2023-11-17 15:20:15,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:15,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1420 transitions. [2023-11-17 15:20:15,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.75) internal successors, (1420), 16 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have 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:20:15,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 209.0) internal successors, (3553), 17 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have 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:20:15,350 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 209.0) internal successors, (3553), 17 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have 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:20:15,351 INFO L175 Difference]: Start difference. First operand has 86 places, 139 transitions, 2053 flow. Second operand 16 states and 1420 transitions. [2023-11-17 15:20:15,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 370 transitions, 5900 flow [2023-11-17 15:20:15,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 370 transitions, 5632 flow, removed 111 selfloop flow, removed 5 redundant places. [2023-11-17 15:20:15,524 INFO L231 Difference]: Finished difference. Result has 105 places, 268 transitions, 4696 flow [2023-11-17 15:20:15,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4696, PETRI_PLACES=105, PETRI_TRANSITIONS=268} [2023-11-17 15:20:15,526 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 71 predicate places. [2023-11-17 15:20:15,526 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 268 transitions, 4696 flow [2023-11-17 15:20:15,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have 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:20:15,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:15,527 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:20:15,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:20:15,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:15,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2127416644, now seen corresponding path program 4 times [2023-11-17 15:20:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727552307] [2023-11-17 15:20:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:16,186 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:20:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727552307] [2023-11-17 15:20:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727552307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:16,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:20:16,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943437376] [2023-11-17 15:20:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:16,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:20:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:20:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:20:16,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 209 [2023-11-17 15:20:16,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 268 transitions, 4696 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:20:16,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:16,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 209 [2023-11-17 15:20:16,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:17,394 INFO L124 PetriNetUnfolderBase]: 3291/5144 cut-off events. [2023-11-17 15:20:17,394 INFO L125 PetriNetUnfolderBase]: For 79906/80224 co-relation queries the response was YES. [2023-11-17 15:20:17,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40010 conditions, 5144 events. 3291/5144 cut-off events. For 79906/80224 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 30086 event pairs, 287 based on Foata normal form. 260/5329 useless extension candidates. Maximal degree in co-relation 39956. Up to 3402 conditions per place. [2023-11-17 15:20:17,447 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 192 selfloop transitions, 136 changer transitions 21/357 dead transitions. [2023-11-17 15:20:17,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 357 transitions, 6784 flow [2023-11-17 15:20:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:20:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:20:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 764 transitions. [2023-11-17 15:20:17,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4569377990430622 [2023-11-17 15:20:17,450 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 764 transitions. [2023-11-17 15:20:17,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 764 transitions. [2023-11-17 15:20:17,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:17,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 764 transitions. [2023-11-17 15:20:17,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have 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:20:17,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:17,455 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:17,455 INFO L175 Difference]: Start difference. First operand has 105 places, 268 transitions, 4696 flow. Second operand 8 states and 764 transitions. [2023-11-17 15:20:17,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 357 transitions, 6784 flow [2023-11-17 15:20:17,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 357 transitions, 6521 flow, removed 124 selfloop flow, removed 4 redundant places. [2023-11-17 15:20:17,808 INFO L231 Difference]: Finished difference. Result has 109 places, 312 transitions, 5808 flow [2023-11-17 15:20:17,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=4469, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5808, PETRI_PLACES=109, PETRI_TRANSITIONS=312} [2023-11-17 15:20:17,808 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 75 predicate places. [2023-11-17 15:20:17,809 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 312 transitions, 5808 flow [2023-11-17 15:20:17,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:20:17,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:17,809 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:20:17,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:20:17,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:17,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:17,810 INFO L85 PathProgramCache]: Analyzing trace with hash -126492748, now seen corresponding path program 5 times [2023-11-17 15:20:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:17,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53402777] [2023-11-17 15:20:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:20:18,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53402777] [2023-11-17 15:20:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53402777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:18,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:20:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141438263] [2023-11-17 15:20:18,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:20:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:20:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:20:18,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 209 [2023-11-17 15:20:18,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 312 transitions, 5808 flow. Second operand has 10 states, 10 states have (on average 79.6) internal successors, (796), 10 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:20:18,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:18,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 209 [2023-11-17 15:20:18,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:20,605 INFO L124 PetriNetUnfolderBase]: 4639/7135 cut-off events. [2023-11-17 15:20:20,605 INFO L125 PetriNetUnfolderBase]: For 99772/99772 co-relation queries the response was YES. [2023-11-17 15:20:20,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55122 conditions, 7135 events. 4639/7135 cut-off events. For 99772/99772 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 42560 event pairs, 325 based on Foata normal form. 38/7173 useless extension candidates. Maximal degree in co-relation 55066. Up to 3279 conditions per place. [2023-11-17 15:20:20,674 INFO L140 encePairwiseOnDemand]: 196/209 looper letters, 253 selfloop transitions, 316 changer transitions 17/586 dead transitions. [2023-11-17 15:20:20,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 586 transitions, 11609 flow [2023-11-17 15:20:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:20:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:20:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 967 transitions. [2023-11-17 15:20:20,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42061765985210964 [2023-11-17 15:20:20,678 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 967 transitions. [2023-11-17 15:20:20,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 967 transitions. [2023-11-17 15:20:20,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:20,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 967 transitions. [2023-11-17 15:20:20,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.9090909090909) internal successors, (967), 11 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have 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:20:20,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 209.0) internal successors, (2508), 12 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have 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:20:20,685 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 209.0) internal successors, (2508), 12 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have 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:20:20,685 INFO L175 Difference]: Start difference. First operand has 109 places, 312 transitions, 5808 flow. Second operand 11 states and 967 transitions. [2023-11-17 15:20:20,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 586 transitions, 11609 flow [2023-11-17 15:20:21,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 586 transitions, 11348 flow, removed 122 selfloop flow, removed 4 redundant places. [2023-11-17 15:20:21,180 INFO L231 Difference]: Finished difference. Result has 120 places, 495 transitions, 10529 flow [2023-11-17 15:20:21,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=5681, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10529, PETRI_PLACES=120, PETRI_TRANSITIONS=495} [2023-11-17 15:20:21,181 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 86 predicate places. [2023-11-17 15:20:21,181 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 495 transitions, 10529 flow [2023-11-17 15:20:21,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 79.6) internal successors, (796), 10 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:20:21,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:21,182 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:20:21,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:20:21,182 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:21,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2050050808, now seen corresponding path program 6 times [2023-11-17 15:20:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:21,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000107968] [2023-11-17 15:20:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:21,838 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:20:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000107968] [2023-11-17 15:20:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000107968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:20:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797333788] [2023-11-17 15:20:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:21,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:20:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:20:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:20:21,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 209 [2023-11-17 15:20:21,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 495 transitions, 10529 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:20:21,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:21,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 209 [2023-11-17 15:20:21,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:23,628 INFO L124 PetriNetUnfolderBase]: 4284/6817 cut-off events. [2023-11-17 15:20:23,628 INFO L125 PetriNetUnfolderBase]: For 136743/137082 co-relation queries the response was YES. [2023-11-17 15:20:23,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60257 conditions, 6817 events. 4284/6817 cut-off events. For 136743/137082 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 43028 event pairs, 252 based on Foata normal form. 303/6982 useless extension candidates. Maximal degree in co-relation 60196. Up to 4503 conditions per place. [2023-11-17 15:20:23,687 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 291 selfloop transitions, 234 changer transitions 14/560 dead transitions. [2023-11-17 15:20:23,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 560 transitions, 12626 flow [2023-11-17 15:20:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:20:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:20:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 749 transitions. [2023-11-17 15:20:23,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479665071770335 [2023-11-17 15:20:23,690 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 749 transitions. [2023-11-17 15:20:23,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 749 transitions. [2023-11-17 15:20:23,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:23,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 749 transitions. [2023-11-17 15:20:23,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have 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:20:23,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:23,696 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:23,696 INFO L175 Difference]: Start difference. First operand has 120 places, 495 transitions, 10529 flow. Second operand 8 states and 749 transitions. [2023-11-17 15:20:23,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 560 transitions, 12626 flow [2023-11-17 15:20:24,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 560 transitions, 12359 flow, removed 75 selfloop flow, removed 8 redundant places. [2023-11-17 15:20:24,164 INFO L231 Difference]: Finished difference. Result has 120 places, 516 transitions, 11439 flow [2023-11-17 15:20:24,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=10292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11439, PETRI_PLACES=120, PETRI_TRANSITIONS=516} [2023-11-17 15:20:24,165 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 86 predicate places. [2023-11-17 15:20:24,165 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 516 transitions, 11439 flow [2023-11-17 15:20:24,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:20:24,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:24,166 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:20:24,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:20:24,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:24,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 395531216, now seen corresponding path program 1 times [2023-11-17 15:20:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:24,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31168765] [2023-11-17 15:20:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:24,449 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:20:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31168765] [2023-11-17 15:20:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31168765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:20:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312582060] [2023-11-17 15:20:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:24,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:20:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:20:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:20:24,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2023-11-17 15:20:24,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 516 transitions, 11439 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have 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:20:24,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:24,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2023-11-17 15:20:24,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:26,703 INFO L124 PetriNetUnfolderBase]: 5817/9058 cut-off events. [2023-11-17 15:20:26,703 INFO L125 PetriNetUnfolderBase]: For 156768/156768 co-relation queries the response was YES. [2023-11-17 15:20:26,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76054 conditions, 9058 events. 5817/9058 cut-off events. For 156768/156768 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 56975 event pairs, 849 based on Foata normal form. 66/9124 useless extension candidates. Maximal degree in co-relation 75995. Up to 4711 conditions per place. [2023-11-17 15:20:26,763 INFO L140 encePairwiseOnDemand]: 201/209 looper letters, 341 selfloop transitions, 28 changer transitions 326/695 dead transitions. [2023-11-17 15:20:26,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 695 transitions, 16558 flow [2023-11-17 15:20:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:20:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:20:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-11-17 15:20:26,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354066985645933 [2023-11-17 15:20:26,765 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-11-17 15:20:26,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-11-17 15:20:26,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:26,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-11-17 15:20:26,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have 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:20:26,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have 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:20:26,769 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have 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:20:26,769 INFO L175 Difference]: Start difference. First operand has 120 places, 516 transitions, 11439 flow. Second operand 6 states and 546 transitions. [2023-11-17 15:20:26,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 695 transitions, 16558 flow [2023-11-17 15:20:27,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 695 transitions, 16380 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-11-17 15:20:27,251 INFO L231 Difference]: Finished difference. Result has 122 places, 307 transitions, 6678 flow [2023-11-17 15:20:27,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=11280, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6678, PETRI_PLACES=122, PETRI_TRANSITIONS=307} [2023-11-17 15:20:27,252 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 88 predicate places. [2023-11-17 15:20:27,252 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 307 transitions, 6678 flow [2023-11-17 15:20:27,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have 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:20:27,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:27,253 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:20:27,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:20:27,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:27,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2119698120, now seen corresponding path program 1 times [2023-11-17 15:20:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:27,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840595535] [2023-11-17 15:20:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:27,959 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:20:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840595535] [2023-11-17 15:20:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840595535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287665761] [2023-11-17 15:20:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:27,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:27,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 209 [2023-11-17 15:20:27,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 307 transitions, 6678 flow. Second operand has 9 states, 9 states have (on average 79.88888888888889) internal successors, (719), 9 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have 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:20:27,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:27,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 209 [2023-11-17 15:20:27,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:29,298 INFO L124 PetriNetUnfolderBase]: 2837/4691 cut-off events. [2023-11-17 15:20:29,298 INFO L125 PetriNetUnfolderBase]: For 84558/84558 co-relation queries the response was YES. [2023-11-17 15:20:29,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37823 conditions, 4691 events. 2837/4691 cut-off events. For 84558/84558 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 28621 event pairs, 577 based on Foata normal form. 32/4723 useless extension candidates. Maximal degree in co-relation 37762. Up to 3220 conditions per place. [2023-11-17 15:20:29,334 INFO L140 encePairwiseOnDemand]: 196/209 looper letters, 205 selfloop transitions, 143 changer transitions 72/420 dead transitions. [2023-11-17 15:20:29,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 420 transitions, 9162 flow [2023-11-17 15:20:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 15:20:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 15:20:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1050 transitions. [2023-11-17 15:20:29,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41866028708133973 [2023-11-17 15:20:29,336 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1050 transitions. [2023-11-17 15:20:29,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1050 transitions. [2023-11-17 15:20:29,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:29,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1050 transitions. [2023-11-17 15:20:29,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:20:29,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 209.0) internal successors, (2717), 13 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have 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:20:29,343 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 209.0) internal successors, (2717), 13 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have 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:20:29,343 INFO L175 Difference]: Start difference. First operand has 122 places, 307 transitions, 6678 flow. Second operand 12 states and 1050 transitions. [2023-11-17 15:20:29,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 420 transitions, 9162 flow [2023-11-17 15:20:29,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 420 transitions, 8864 flow, removed 86 selfloop flow, removed 8 redundant places. [2023-11-17 15:20:29,547 INFO L231 Difference]: Finished difference. Result has 126 places, 319 transitions, 6939 flow [2023-11-17 15:20:29,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6432, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6939, PETRI_PLACES=126, PETRI_TRANSITIONS=319} [2023-11-17 15:20:29,548 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 92 predicate places. [2023-11-17 15:20:29,548 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 319 transitions, 6939 flow [2023-11-17 15:20:29,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.88888888888889) internal successors, (719), 9 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have 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:20:29,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:29,548 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:20:29,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:20:29,549 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:29,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1759524930, now seen corresponding path program 2 times [2023-11-17 15:20:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537889048] [2023-11-17 15:20:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:29,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:30,079 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:20:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537889048] [2023-11-17 15:20:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537889048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285346907] [2023-11-17 15:20:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:30,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:30,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:30,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209 [2023-11-17 15:20:30,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 319 transitions, 6939 flow. Second operand has 9 states, 9 states have (on average 87.88888888888889) internal successors, (791), 9 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have 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:20:30,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:30,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209 [2023-11-17 15:20:30,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:31,034 INFO L124 PetriNetUnfolderBase]: 2292/3839 cut-off events. [2023-11-17 15:20:31,035 INFO L125 PetriNetUnfolderBase]: For 73346/73464 co-relation queries the response was YES. [2023-11-17 15:20:31,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31654 conditions, 3839 events. 2292/3839 cut-off events. For 73346/73464 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23013 event pairs, 591 based on Foata normal form. 121/3947 useless extension candidates. Maximal degree in co-relation 31593. Up to 3016 conditions per place. [2023-11-17 15:20:31,074 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 209 selfloop transitions, 84 changer transitions 55/360 dead transitions. [2023-11-17 15:20:31,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 360 transitions, 8279 flow [2023-11-17 15:20:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:20:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:20:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 752 transitions. [2023-11-17 15:20:31,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44976076555023925 [2023-11-17 15:20:31,077 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 752 transitions. [2023-11-17 15:20:31,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 752 transitions. [2023-11-17 15:20:31,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:31,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 752 transitions. [2023-11-17 15:20:31,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have 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:20:31,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:31,081 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:31,081 INFO L175 Difference]: Start difference. First operand has 126 places, 319 transitions, 6939 flow. Second operand 8 states and 752 transitions. [2023-11-17 15:20:31,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 360 transitions, 8279 flow [2023-11-17 15:20:31,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 360 transitions, 8207 flow, removed 36 selfloop flow, removed 3 redundant places. [2023-11-17 15:20:31,291 INFO L231 Difference]: Finished difference. Result has 129 places, 295 transitions, 6470 flow [2023-11-17 15:20:31,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6871, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6470, PETRI_PLACES=129, PETRI_TRANSITIONS=295} [2023-11-17 15:20:31,292 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2023-11-17 15:20:31,292 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 295 transitions, 6470 flow [2023-11-17 15:20:31,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.88888888888889) internal successors, (791), 9 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have 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:20:31,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:31,292 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:20:31,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 15:20:31,293 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:31,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1528784034, now seen corresponding path program 3 times [2023-11-17 15:20:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590982112] [2023-11-17 15:20:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:32,007 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:20:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590982112] [2023-11-17 15:20:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590982112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:32,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:32,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79993879] [2023-11-17 15:20:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:32,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:32,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 209 [2023-11-17 15:20:32,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 295 transitions, 6470 flow. Second operand has 9 states, 9 states have (on average 86.88888888888889) internal successors, (782), 9 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have 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:20:32,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:32,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 209 [2023-11-17 15:20:32,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:32,931 INFO L124 PetriNetUnfolderBase]: 2413/4022 cut-off events. [2023-11-17 15:20:32,931 INFO L125 PetriNetUnfolderBase]: For 74681/74760 co-relation queries the response was YES. [2023-11-17 15:20:32,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32952 conditions, 4022 events. 2413/4022 cut-off events. For 74681/74760 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24284 event pairs, 898 based on Foata normal form. 90/4078 useless extension candidates. Maximal degree in co-relation 32890. Up to 3019 conditions per place. [2023-11-17 15:20:32,961 INFO L140 encePairwiseOnDemand]: 200/209 looper letters, 257 selfloop transitions, 59 changer transitions 46/374 dead transitions. [2023-11-17 15:20:32,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 374 transitions, 8625 flow [2023-11-17 15:20:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:20:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:20:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 744 transitions. [2023-11-17 15:20:32,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449760765550239 [2023-11-17 15:20:32,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 744 transitions. [2023-11-17 15:20:32,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 744 transitions. [2023-11-17 15:20:32,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:32,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 744 transitions. [2023-11-17 15:20:32,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:20:32,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:32,965 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:32,965 INFO L175 Difference]: Start difference. First operand has 129 places, 295 transitions, 6470 flow. Second operand 8 states and 744 transitions. [2023-11-17 15:20:32,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 374 transitions, 8625 flow [2023-11-17 15:20:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 374 transitions, 8350 flow, removed 16 selfloop flow, removed 7 redundant places. [2023-11-17 15:20:33,196 INFO L231 Difference]: Finished difference. Result has 131 places, 305 transitions, 6671 flow [2023-11-17 15:20:33,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6203, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6671, PETRI_PLACES=131, PETRI_TRANSITIONS=305} [2023-11-17 15:20:33,197 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 97 predicate places. [2023-11-17 15:20:33,197 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 305 transitions, 6671 flow [2023-11-17 15:20:33,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.88888888888889) internal successors, (782), 9 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have 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:20:33,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:33,198 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:20:33,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 15:20:33,199 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:33,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1540402524, now seen corresponding path program 4 times [2023-11-17 15:20:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549815621] [2023-11-17 15:20:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:33,954 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:20:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:33,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549815621] [2023-11-17 15:20:33,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549815621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:33,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:33,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:20:33,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139874417] [2023-11-17 15:20:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:33,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:20:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:33,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:20:33,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:20:33,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 209 [2023-11-17 15:20:33,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 305 transitions, 6671 flow. Second operand has 10 states, 10 states have (on average 83.7) internal successors, (837), 10 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have 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:20:33,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:33,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 209 [2023-11-17 15:20:33,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:34,951 INFO L124 PetriNetUnfolderBase]: 2153/3600 cut-off events. [2023-11-17 15:20:34,951 INFO L125 PetriNetUnfolderBase]: For 70681/70838 co-relation queries the response was YES. [2023-11-17 15:20:34,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30418 conditions, 3600 events. 2153/3600 cut-off events. For 70681/70838 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21248 event pairs, 618 based on Foata normal form. 160/3747 useless extension candidates. Maximal degree in co-relation 30353. Up to 2927 conditions per place. [2023-11-17 15:20:34,980 INFO L140 encePairwiseOnDemand]: 200/209 looper letters, 265 selfloop transitions, 49 changer transitions 38/364 dead transitions. [2023-11-17 15:20:34,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 364 transitions, 8370 flow [2023-11-17 15:20:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:20:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:20:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 804 transitions. [2023-11-17 15:20:34,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274322169059011 [2023-11-17 15:20:34,982 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 804 transitions. [2023-11-17 15:20:34,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 804 transitions. [2023-11-17 15:20:34,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:34,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 804 transitions. [2023-11-17 15:20:34,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.33333333333333) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:20:34,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have 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:20:34,986 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have 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:20:34,986 INFO L175 Difference]: Start difference. First operand has 131 places, 305 transitions, 6671 flow. Second operand 9 states and 804 transitions. [2023-11-17 15:20:34,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 364 transitions, 8370 flow [2023-11-17 15:20:35,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 364 transitions, 8104 flow, removed 68 selfloop flow, removed 6 redundant places. [2023-11-17 15:20:35,156 INFO L231 Difference]: Finished difference. Result has 135 places, 301 transitions, 6489 flow [2023-11-17 15:20:35,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6433, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6489, PETRI_PLACES=135, PETRI_TRANSITIONS=301} [2023-11-17 15:20:35,156 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 101 predicate places. [2023-11-17 15:20:35,156 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 301 transitions, 6489 flow [2023-11-17 15:20:35,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.7) internal successors, (837), 10 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have 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:20:35,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:35,157 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:20:35,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 15:20:35,157 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:35,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash -548884632, now seen corresponding path program 5 times [2023-11-17 15:20:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068992060] [2023-11-17 15:20:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:35,994 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:20:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068992060] [2023-11-17 15:20:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068992060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:35,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:35,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:20:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756672114] [2023-11-17 15:20:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:35,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:20:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:35,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:20:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:20:35,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 209 [2023-11-17 15:20:35,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 301 transitions, 6489 flow. Second operand has 10 states, 10 states have (on average 84.7) internal successors, (847), 10 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have 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:20:35,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:35,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 209 [2023-11-17 15:20:35,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:36,915 INFO L124 PetriNetUnfolderBase]: 2170/3621 cut-off events. [2023-11-17 15:20:36,915 INFO L125 PetriNetUnfolderBase]: For 66676/66801 co-relation queries the response was YES. [2023-11-17 15:20:36,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29506 conditions, 3621 events. 2170/3621 cut-off events. For 66676/66801 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21336 event pairs, 608 based on Foata normal form. 132/3742 useless extension candidates. Maximal degree in co-relation 29440. Up to 3015 conditions per place. [2023-11-17 15:20:36,947 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 241 selfloop transitions, 62 changer transitions 40/355 dead transitions. [2023-11-17 15:20:36,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 355 transitions, 7999 flow [2023-11-17 15:20:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:20:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:20:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2023-11-17 15:20:36,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348750664540138 [2023-11-17 15:20:36,949 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 818 transitions. [2023-11-17 15:20:36,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 818 transitions. [2023-11-17 15:20:36,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:36,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 818 transitions. [2023-11-17 15:20:36,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have 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:20:36,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have 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:20:36,952 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have 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:20:36,952 INFO L175 Difference]: Start difference. First operand has 135 places, 301 transitions, 6489 flow. Second operand 9 states and 818 transitions. [2023-11-17 15:20:36,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 355 transitions, 7999 flow [2023-11-17 15:20:37,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 355 transitions, 7893 flow, removed 16 selfloop flow, removed 7 redundant places. [2023-11-17 15:20:37,115 INFO L231 Difference]: Finished difference. Result has 136 places, 301 transitions, 6641 flow [2023-11-17 15:20:37,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6397, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6641, PETRI_PLACES=136, PETRI_TRANSITIONS=301} [2023-11-17 15:20:37,116 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 102 predicate places. [2023-11-17 15:20:37,116 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 301 transitions, 6641 flow [2023-11-17 15:20:37,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.7) internal successors, (847), 10 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have 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:20:37,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:37,117 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:20:37,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 15:20:37,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:37,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1163537930, now seen corresponding path program 6 times [2023-11-17 15:20:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74136795] [2023-11-17 15:20:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:37,515 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:20:37,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74136795] [2023-11-17 15:20:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74136795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:20:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003415229] [2023-11-17 15:20:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:37,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:20:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:20:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:20:37,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 209 [2023-11-17 15:20:37,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 301 transitions, 6641 flow. Second operand has 8 states, 8 states have (on average 82.125) internal successors, (657), 8 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:20:37,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:37,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 209 [2023-11-17 15:20:37,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:38,415 INFO L124 PetriNetUnfolderBase]: 2340/3793 cut-off events. [2023-11-17 15:20:38,415 INFO L125 PetriNetUnfolderBase]: For 70999/70999 co-relation queries the response was YES. [2023-11-17 15:20:38,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31051 conditions, 3793 events. 2340/3793 cut-off events. For 70999/70999 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21739 event pairs, 635 based on Foata normal form. 32/3825 useless extension candidates. Maximal degree in co-relation 30985. Up to 2732 conditions per place. [2023-11-17 15:20:38,446 INFO L140 encePairwiseOnDemand]: 196/209 looper letters, 195 selfloop transitions, 132 changer transitions 40/367 dead transitions. [2023-11-17 15:20:38,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 367 transitions, 8345 flow [2023-11-17 15:20:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:20:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:20:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 800 transitions. [2023-11-17 15:20:38,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253056884635832 [2023-11-17 15:20:38,448 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 800 transitions. [2023-11-17 15:20:38,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 800 transitions. [2023-11-17 15:20:38,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:38,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 800 transitions. [2023-11-17 15:20:38,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.88888888888889) internal successors, (800), 9 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have 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:20:38,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have 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:20:38,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have 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:20:38,451 INFO L175 Difference]: Start difference. First operand has 136 places, 301 transitions, 6641 flow. Second operand 9 states and 800 transitions. [2023-11-17 15:20:38,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 367 transitions, 8345 flow [2023-11-17 15:20:38,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 367 transitions, 8120 flow, removed 54 selfloop flow, removed 11 redundant places. [2023-11-17 15:20:38,588 INFO L231 Difference]: Finished difference. Result has 132 places, 310 transitions, 6982 flow [2023-11-17 15:20:38,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6426, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6982, PETRI_PLACES=132, PETRI_TRANSITIONS=310} [2023-11-17 15:20:38,589 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2023-11-17 15:20:38,589 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 310 transitions, 6982 flow [2023-11-17 15:20:38,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.125) internal successors, (657), 8 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:20:38,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:38,589 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:20:38,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 15:20:38,589 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:38,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1496721290, now seen corresponding path program 7 times [2023-11-17 15:20:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921541009] [2023-11-17 15:20:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:20:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921541009] [2023-11-17 15:20:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921541009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 15:20:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117061476] [2023-11-17 15:20:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:39,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 15:20:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 15:20:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-17 15:20:39,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 209 [2023-11-17 15:20:39,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 310 transitions, 6982 flow. Second operand has 11 states, 11 states have (on average 79.54545454545455) internal successors, (875), 11 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:20:39,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:39,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 209 [2023-11-17 15:20:39,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:40,438 INFO L124 PetriNetUnfolderBase]: 2151/3515 cut-off events. [2023-11-17 15:20:40,439 INFO L125 PetriNetUnfolderBase]: For 70969/70969 co-relation queries the response was YES. [2023-11-17 15:20:40,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29913 conditions, 3515 events. 2151/3515 cut-off events. For 70969/70969 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19777 event pairs, 318 based on Foata normal form. 60/3575 useless extension candidates. Maximal degree in co-relation 29848. Up to 1635 conditions per place. [2023-11-17 15:20:40,467 INFO L140 encePairwiseOnDemand]: 196/209 looper letters, 181 selfloop transitions, 194 changer transitions 55/430 dead transitions. [2023-11-17 15:20:40,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 430 transitions, 9913 flow [2023-11-17 15:20:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 15:20:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 15:20:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1207 transitions. [2023-11-17 15:20:40,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41250854408749144 [2023-11-17 15:20:40,470 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1207 transitions. [2023-11-17 15:20:40,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1207 transitions. [2023-11-17 15:20:40,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:40,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1207 transitions. [2023-11-17 15:20:40,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 86.21428571428571) internal successors, (1207), 14 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have 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:20:40,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 209.0) internal successors, (3135), 15 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states have 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:20:40,475 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 209.0) internal successors, (3135), 15 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states have 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:20:40,475 INFO L175 Difference]: Start difference. First operand has 132 places, 310 transitions, 6982 flow. Second operand 14 states and 1207 transitions. [2023-11-17 15:20:40,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 430 transitions, 9913 flow [2023-11-17 15:20:40,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 430 transitions, 9716 flow, removed 98 selfloop flow, removed 4 redundant places. [2023-11-17 15:20:40,648 INFO L231 Difference]: Finished difference. Result has 148 places, 334 transitions, 8134 flow [2023-11-17 15:20:40,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=6827, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8134, PETRI_PLACES=148, PETRI_TRANSITIONS=334} [2023-11-17 15:20:40,648 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 114 predicate places. [2023-11-17 15:20:40,649 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 334 transitions, 8134 flow [2023-11-17 15:20:40,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.54545454545455) internal successors, (875), 11 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:20:40,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:40,649 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:20:40,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-17 15:20:40,649 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:40,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1516067547, now seen corresponding path program 1 times [2023-11-17 15:20:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397883917] [2023-11-17 15:20:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:20:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397883917] [2023-11-17 15:20:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397883917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:20:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019385224] [2023-11-17 15:20:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:20:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:20:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:20:40,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-17 15:20:40,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 334 transitions, 8134 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:20:40,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:40,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-17 15:20:40,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:41,034 INFO L124 PetriNetUnfolderBase]: 644/1124 cut-off events. [2023-11-17 15:20:41,034 INFO L125 PetriNetUnfolderBase]: For 29059/29096 co-relation queries the response was YES. [2023-11-17 15:20:41,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10110 conditions, 1124 events. 644/1124 cut-off events. For 29059/29096 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5438 event pairs, 94 based on Foata normal form. 111/1235 useless extension candidates. Maximal degree in co-relation 10037. Up to 906 conditions per place. [2023-11-17 15:20:41,043 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 223 selfloop transitions, 4 changer transitions 0/240 dead transitions. [2023-11-17 15:20:41,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 240 transitions, 6109 flow [2023-11-17 15:20:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:20:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:20:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-17 15:20:41,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960127591706539 [2023-11-17 15:20:41,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-17 15:20:41,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-17 15:20:41,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:41,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-17 15:20:41,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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:20:41,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:20:41,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:20:41,045 INFO L175 Difference]: Start difference. First operand has 148 places, 334 transitions, 8134 flow. Second operand 3 states and 311 transitions. [2023-11-17 15:20:41,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 240 transitions, 6109 flow [2023-11-17 15:20:41,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 240 transitions, 5607 flow, removed 132 selfloop flow, removed 21 redundant places. [2023-11-17 15:20:41,089 INFO L231 Difference]: Finished difference. Result has 121 places, 187 transitions, 4022 flow [2023-11-17 15:20:41,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=3996, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4022, PETRI_PLACES=121, PETRI_TRANSITIONS=187} [2023-11-17 15:20:41,089 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 87 predicate places. [2023-11-17 15:20:41,089 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 187 transitions, 4022 flow [2023-11-17 15:20:41,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:20:41,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:41,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:41,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-17 15:20:41,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:41,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 657711353, now seen corresponding path program 1 times [2023-11-17 15:20:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123049913] [2023-11-17 15:20:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:41,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:20:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123049913] [2023-11-17 15:20:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123049913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:20:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535232014] [2023-11-17 15:20:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:20:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:41,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:20:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:20:41,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-17 15:20:41,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 187 transitions, 4022 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:20:41,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:41,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-17 15:20:41,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:41,416 INFO L124 PetriNetUnfolderBase]: 297/580 cut-off events. [2023-11-17 15:20:41,416 INFO L125 PetriNetUnfolderBase]: For 12004/12004 co-relation queries the response was YES. [2023-11-17 15:20:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5271 conditions, 580 events. 297/580 cut-off events. For 12004/12004 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2581 event pairs, 19 based on Foata normal form. 77/657 useless extension candidates. Maximal degree in co-relation 5213. Up to 256 conditions per place. [2023-11-17 15:20:41,423 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 201 selfloop transitions, 7 changer transitions 0/220 dead transitions. [2023-11-17 15:20:41,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 220 transitions, 5017 flow [2023-11-17 15:20:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:20:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:20:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2023-11-17 15:20:41,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49401913875598086 [2023-11-17 15:20:41,424 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2023-11-17 15:20:41,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2023-11-17 15:20:41,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:41,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2023-11-17 15:20:41,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:20:41,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:20:41,426 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:20:41,426 INFO L175 Difference]: Start difference. First operand has 121 places, 187 transitions, 4022 flow. Second operand 4 states and 413 transitions. [2023-11-17 15:20:41,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 220 transitions, 5017 flow [2023-11-17 15:20:41,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 220 transitions, 4697 flow, removed 36 selfloop flow, removed 10 redundant places. [2023-11-17 15:20:41,464 INFO L231 Difference]: Finished difference. Result has 114 places, 151 transitions, 2939 flow [2023-11-17 15:20:41,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2899, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2939, PETRI_PLACES=114, PETRI_TRANSITIONS=151} [2023-11-17 15:20:41,465 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2023-11-17 15:20:41,465 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 151 transitions, 2939 flow [2023-11-17 15:20:41,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:20:41,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:41,465 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:20:41,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 15:20:41,465 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:41,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 82492000, now seen corresponding path program 1 times [2023-11-17 15:20:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:41,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581089568] [2023-11-17 15:20:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:41,623 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:20:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581089568] [2023-11-17 15:20:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581089568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:41,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:20:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94058727] [2023-11-17 15:20:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:41,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:20:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:20:41,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:20:41,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209 [2023-11-17 15:20:41,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 151 transitions, 2939 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have 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:20:41,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:41,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209 [2023-11-17 15:20:41,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:41,747 INFO L124 PetriNetUnfolderBase]: 243/467 cut-off events. [2023-11-17 15:20:41,747 INFO L125 PetriNetUnfolderBase]: For 8927/8927 co-relation queries the response was YES. [2023-11-17 15:20:41,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 467 events. 243/467 cut-off events. For 8927/8927 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2064 event pairs, 11 based on Foata normal form. 22/489 useless extension candidates. Maximal degree in co-relation 4201. Up to 206 conditions per place. [2023-11-17 15:20:41,750 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 158 selfloop transitions, 10 changer transitions 36/215 dead transitions. [2023-11-17 15:20:41,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 215 transitions, 4636 flow [2023-11-17 15:20:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:20:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:20:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-11-17 15:20:41,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2023-11-17 15:20:41,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-11-17 15:20:41,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-11-17 15:20:41,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:41,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-11-17 15:20:41,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:20:41,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have 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:20:41,756 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have 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:20:41,756 INFO L175 Difference]: Start difference. First operand has 114 places, 151 transitions, 2939 flow. Second operand 5 states and 505 transitions. [2023-11-17 15:20:41,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 215 transitions, 4636 flow [2023-11-17 15:20:41,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 215 transitions, 4375 flow, removed 92 selfloop flow, removed 6 redundant places. [2023-11-17 15:20:41,780 INFO L231 Difference]: Finished difference. Result has 113 places, 129 transitions, 2323 flow [2023-11-17 15:20:41,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2323, PETRI_PLACES=113, PETRI_TRANSITIONS=129} [2023-11-17 15:20:41,781 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 79 predicate places. [2023-11-17 15:20:41,781 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 129 transitions, 2323 flow [2023-11-17 15:20:41,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have 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:20:41,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:41,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:41,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-17 15:20:41,781 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:41,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 780942375, now seen corresponding path program 1 times [2023-11-17 15:20:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103971350] [2023-11-17 15:20:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:42,991 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:20:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103971350] [2023-11-17 15:20:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103971350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 15:20:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530321826] [2023-11-17 15:20:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:42,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 15:20:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 15:20:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-17 15:20:42,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 209 [2023-11-17 15:20:42,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 129 transitions, 2323 flow. Second operand has 10 states, 10 states have (on average 81.2) internal successors, (812), 10 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have 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:20:42,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:42,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 209 [2023-11-17 15:20:42,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:43,425 INFO L124 PetriNetUnfolderBase]: 275/563 cut-off events. [2023-11-17 15:20:43,425 INFO L125 PetriNetUnfolderBase]: For 7208/7208 co-relation queries the response was YES. [2023-11-17 15:20:43,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 563 events. 275/563 cut-off events. For 7208/7208 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2727 event pairs, 58 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 4469. Up to 306 conditions per place. [2023-11-17 15:20:43,430 INFO L140 encePairwiseOnDemand]: 197/209 looper letters, 81 selfloop transitions, 56 changer transitions 41/178 dead transitions. [2023-11-17 15:20:43,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 178 transitions, 3248 flow [2023-11-17 15:20:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:20:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:20:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 944 transitions. [2023-11-17 15:20:43,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41061331013484126 [2023-11-17 15:20:43,432 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 944 transitions. [2023-11-17 15:20:43,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 944 transitions. [2023-11-17 15:20:43,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:43,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 944 transitions. [2023-11-17 15:20:43,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 85.81818181818181) internal successors, (944), 11 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have 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:20:43,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 209.0) internal successors, (2508), 12 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have 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:20:43,436 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 209.0) internal successors, (2508), 12 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have 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:20:43,436 INFO L175 Difference]: Start difference. First operand has 113 places, 129 transitions, 2323 flow. Second operand 11 states and 944 transitions. [2023-11-17 15:20:43,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 178 transitions, 3248 flow [2023-11-17 15:20:43,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 178 transitions, 3019 flow, removed 48 selfloop flow, removed 10 redundant places. [2023-11-17 15:20:43,459 INFO L231 Difference]: Finished difference. Result has 118 places, 124 transitions, 2176 flow [2023-11-17 15:20:43,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2176, PETRI_PLACES=118, PETRI_TRANSITIONS=124} [2023-11-17 15:20:43,460 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 84 predicate places. [2023-11-17 15:20:43,460 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 124 transitions, 2176 flow [2023-11-17 15:20:43,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.2) internal successors, (812), 10 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have 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:20:43,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:43,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:43,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-17 15:20:43,461 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:43,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 990371355, now seen corresponding path program 2 times [2023-11-17 15:20:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432257594] [2023-11-17 15:20:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:44,772 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:20:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:44,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432257594] [2023-11-17 15:20:44,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432257594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:44,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:44,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-17 15:20:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962768852] [2023-11-17 15:20:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:44,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:20:44,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:44,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:20:44,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-17 15:20:44,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 209 [2023-11-17 15:20:44,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 124 transitions, 2176 flow. Second operand has 12 states, 12 states have (on average 77.83333333333333) internal successors, (934), 12 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have 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:20:44,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:44,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 209 [2023-11-17 15:20:44,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:45,187 INFO L124 PetriNetUnfolderBase]: 189/405 cut-off events. [2023-11-17 15:20:45,187 INFO L125 PetriNetUnfolderBase]: For 4576/4576 co-relation queries the response was YES. [2023-11-17 15:20:45,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 405 events. 189/405 cut-off events. For 4576/4576 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1784 event pairs, 51 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 3254. Up to 259 conditions per place. [2023-11-17 15:20:45,191 INFO L140 encePairwiseOnDemand]: 198/209 looper letters, 67 selfloop transitions, 40 changer transitions 40/147 dead transitions. [2023-11-17 15:20:45,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 2617 flow [2023-11-17 15:20:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 820 transitions. [2023-11-17 15:20:45,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923444976076555 [2023-11-17 15:20:45,193 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 820 transitions. [2023-11-17 15:20:45,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 820 transitions. [2023-11-17 15:20:45,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:45,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 820 transitions. [2023-11-17 15:20:45,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have 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:20:45,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:45,196 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:45,196 INFO L175 Difference]: Start difference. First operand has 118 places, 124 transitions, 2176 flow. Second operand 10 states and 820 transitions. [2023-11-17 15:20:45,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 2617 flow [2023-11-17 15:20:45,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 147 transitions, 2534 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-11-17 15:20:45,219 INFO L231 Difference]: Finished difference. Result has 121 places, 105 transitions, 1858 flow [2023-11-17 15:20:45,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1858, PETRI_PLACES=121, PETRI_TRANSITIONS=105} [2023-11-17 15:20:45,220 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 87 predicate places. [2023-11-17 15:20:45,220 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 105 transitions, 1858 flow [2023-11-17 15:20:45,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.83333333333333) internal successors, (934), 12 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have 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:20:45,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:45,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-17 15:20:45,220 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:45,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1594663863, now seen corresponding path program 3 times [2023-11-17 15:20:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113302400] [2023-11-17 15:20:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:46,693 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:20:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113302400] [2023-11-17 15:20:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113302400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:46,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:46,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-17 15:20:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421539256] [2023-11-17 15:20:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:46,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:20:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:46,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:20:46,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-17 15:20:46,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 209 [2023-11-17 15:20:46,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 105 transitions, 1858 flow. Second operand has 12 states, 12 states have (on average 80.75) internal successors, (969), 12 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have 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:20:46,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:46,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 209 [2023-11-17 15:20:46,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:47,123 INFO L124 PetriNetUnfolderBase]: 177/377 cut-off events. [2023-11-17 15:20:47,123 INFO L125 PetriNetUnfolderBase]: For 4722/4729 co-relation queries the response was YES. [2023-11-17 15:20:47,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 377 events. 177/377 cut-off events. For 4722/4729 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1614 event pairs, 37 based on Foata normal form. 8/385 useless extension candidates. Maximal degree in co-relation 2959. Up to 251 conditions per place. [2023-11-17 15:20:47,126 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 64 selfloop transitions, 18 changer transitions 45/133 dead transitions. [2023-11-17 15:20:47,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 2353 flow [2023-11-17 15:20:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 845 transitions. [2023-11-17 15:20:47,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043062200956938 [2023-11-17 15:20:47,127 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 845 transitions. [2023-11-17 15:20:47,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 845 transitions. [2023-11-17 15:20:47,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:47,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 845 transitions. [2023-11-17 15:20:47,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.5) internal successors, (845), 10 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have 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:20:47,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:47,130 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:47,130 INFO L175 Difference]: Start difference. First operand has 121 places, 105 transitions, 1858 flow. Second operand 10 states and 845 transitions. [2023-11-17 15:20:47,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 2353 flow [2023-11-17 15:20:47,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 2226 flow, removed 32 selfloop flow, removed 9 redundant places. [2023-11-17 15:20:47,150 INFO L231 Difference]: Finished difference. Result has 120 places, 84 transitions, 1359 flow [2023-11-17 15:20:47,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1359, PETRI_PLACES=120, PETRI_TRANSITIONS=84} [2023-11-17 15:20:47,150 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 86 predicate places. [2023-11-17 15:20:47,150 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 84 transitions, 1359 flow [2023-11-17 15:20:47,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.75) internal successors, (969), 12 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have 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:20:47,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:47,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:47,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-17 15:20:47,151 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:47,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1119240833, now seen corresponding path program 4 times [2023-11-17 15:20:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442162281] [2023-11-17 15:20:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:47,780 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:20:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442162281] [2023-11-17 15:20:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442162281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:47,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:47,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450607421] [2023-11-17 15:20:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:47,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:47,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 209 [2023-11-17 15:20:47,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 84 transitions, 1359 flow. Second operand has 9 states, 9 states have (on average 84.33333333333333) internal successors, (759), 9 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have 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:20:47,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:47,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 209 [2023-11-17 15:20:47,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:48,037 INFO L124 PetriNetUnfolderBase]: 165/359 cut-off events. [2023-11-17 15:20:48,037 INFO L125 PetriNetUnfolderBase]: For 3670/3673 co-relation queries the response was YES. [2023-11-17 15:20:48,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 359 events. 165/359 cut-off events. For 3670/3673 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1513 event pairs, 20 based on Foata normal form. 4/363 useless extension candidates. Maximal degree in co-relation 2522. Up to 124 conditions per place. [2023-11-17 15:20:48,040 INFO L140 encePairwiseOnDemand]: 200/209 looper letters, 63 selfloop transitions, 23 changer transitions 30/120 dead transitions. [2023-11-17 15:20:48,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 120 transitions, 1859 flow [2023-11-17 15:20:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:20:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:20:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 877 transitions. [2023-11-17 15:20:48,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4196172248803828 [2023-11-17 15:20:48,041 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 877 transitions. [2023-11-17 15:20:48,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 877 transitions. [2023-11-17 15:20:48,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:48,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 877 transitions. [2023-11-17 15:20:48,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.7) internal successors, (877), 10 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have 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:20:48,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:48,044 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 209.0) internal successors, (2299), 11 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have 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:20:48,044 INFO L175 Difference]: Start difference. First operand has 120 places, 84 transitions, 1359 flow. Second operand 10 states and 877 transitions. [2023-11-17 15:20:48,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 120 transitions, 1859 flow [2023-11-17 15:20:48,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 120 transitions, 1658 flow, removed 37 selfloop flow, removed 19 redundant places. [2023-11-17 15:20:48,056 INFO L231 Difference]: Finished difference. Result has 110 places, 72 transitions, 1060 flow [2023-11-17 15:20:48,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1060, PETRI_PLACES=110, PETRI_TRANSITIONS=72} [2023-11-17 15:20:48,056 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2023-11-17 15:20:48,056 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 72 transitions, 1060 flow [2023-11-17 15:20:48,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.33333333333333) internal successors, (759), 9 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have 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:20:48,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:48,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:48,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-17 15:20:48,057 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:48,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2004500033, now seen corresponding path program 5 times [2023-11-17 15:20:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:48,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441342456] [2023-11-17 15:20:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:20:48,483 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:20:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:20:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441342456] [2023-11-17 15:20:48,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441342456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:20:48,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:20:48,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:20:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305561339] [2023-11-17 15:20:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:20:48,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:20:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:20:48,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:20:48,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:20:48,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209 [2023-11-17 15:20:48,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 72 transitions, 1060 flow. Second operand has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have 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:20:48,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:20:48,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209 [2023-11-17 15:20:48,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:20:48,693 INFO L124 PetriNetUnfolderBase]: 175/382 cut-off events. [2023-11-17 15:20:48,693 INFO L125 PetriNetUnfolderBase]: For 4129/4132 co-relation queries the response was YES. [2023-11-17 15:20:48,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 382 events. 175/382 cut-off events. For 4129/4132 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1749 event pairs, 9 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 2582. Up to 184 conditions per place. [2023-11-17 15:20:48,696 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 65 selfloop transitions, 17 changer transitions 28/114 dead transitions. [2023-11-17 15:20:48,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 114 transitions, 1644 flow [2023-11-17 15:20:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:20:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:20:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 739 transitions. [2023-11-17 15:20:48,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44198564593301437 [2023-11-17 15:20:48,698 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 739 transitions. [2023-11-17 15:20:48,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 739 transitions. [2023-11-17 15:20:48,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:20:48,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 739 transitions. [2023-11-17 15:20:48,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have 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:20:48,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:48,701 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have 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:20:48,701 INFO L175 Difference]: Start difference. First operand has 110 places, 72 transitions, 1060 flow. Second operand 8 states and 739 transitions. [2023-11-17 15:20:48,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 114 transitions, 1644 flow [2023-11-17 15:20:48,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 114 transitions, 1438 flow, removed 42 selfloop flow, removed 18 redundant places. [2023-11-17 15:20:48,715 INFO L231 Difference]: Finished difference. Result has 92 places, 69 transitions, 902 flow [2023-11-17 15:20:48,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=902, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2023-11-17 15:20:48,716 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2023-11-17 15:20:48,716 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 902 flow [2023-11-17 15:20:48,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have 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:20:48,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:20:48,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:48,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-17 15:20:48,716 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:20:48,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:20:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1509667677, now seen corresponding path program 6 times [2023-11-17 15:20:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:20:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166499391] [2023-11-17 15:20:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:20:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:20:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:20:48,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:20:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:20:48,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:20:48,805 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:20:48,806 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:20:48,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:20:48,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:20:48,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:20:48,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:20:48,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:20:48,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-17 15:20:48,809 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:20:48,814 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:20:48,814 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:20:48,859 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:20:48,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:20:48,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:20:48,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:20:48 BasicIcfg [2023-11-17 15:20:48,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:20:48,883 INFO L158 Benchmark]: Toolchain (without parser) took 55312.25ms. Allocated memory was 274.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 225.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 15:20:48,884 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:20:48,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.33ms. Allocated memory is still 274.7MB. Free memory was 224.9MB in the beginning and 199.3MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 15:20:48,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.56ms. Allocated memory is still 274.7MB. Free memory was 199.3MB in the beginning and 196.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:20:48,884 INFO L158 Benchmark]: Boogie Preprocessor took 63.64ms. Allocated memory is still 274.7MB. Free memory was 196.6MB in the beginning and 194.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:20:48,884 INFO L158 Benchmark]: RCFGBuilder took 821.95ms. Allocated memory is still 274.7MB. Free memory was 194.0MB in the beginning and 141.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-11-17 15:20:48,885 INFO L158 Benchmark]: TraceAbstraction took 53784.12ms. Allocated memory was 274.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 141.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-11-17 15:20:48,886 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.15ms. Allocated memory is still 201.3MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 565.33ms. Allocated memory is still 274.7MB. Free memory was 224.9MB in the beginning and 199.3MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.56ms. Allocated memory is still 274.7MB. Free memory was 199.3MB in the beginning and 196.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.64ms. Allocated memory is still 274.7MB. Free memory was 196.6MB in the beginning and 194.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 821.95ms. Allocated memory is still 274.7MB. Free memory was 194.0MB in the beginning and 141.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * TraceAbstraction took 53784.12ms. Allocated memory was 274.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 141.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 117 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 25 TransitionsAfterwards, 2304 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2482, independent: 2319, independent conditional: 0, independent unconditional: 2319, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1535, independent: 1494, independent conditional: 0, independent unconditional: 1494, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1535, independent: 1459, independent conditional: 0, independent unconditional: 1459, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 456, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2482, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1535, unknown conditional: 0, unknown unconditional: 1535] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 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) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 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_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: 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: 852]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.6s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1123 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 581 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5959 IncrementalHoareTripleChecker+Invalid, 6540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 581 mSolverCounterUnsat, 28 mSDtfsCounter, 5959 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11439occurred in iteration=13, InterpolantAutomatonStates: 245, 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, 1.0s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 7163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:20:48,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...