/usr/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:14:49,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:14:49,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:14:50,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:14:50,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:14:50,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:14:50,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:14:50,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:14:50,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:14:50,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:14:50,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:14:50,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:14:50,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:14:50,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:14:50,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:14:50,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:14:50,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:14:50,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:14:50,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:14:50,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:14:50,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:14:50,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:14:50,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:14:50,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:14:50,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:14:50,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:14:50,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:14:50,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:14:50,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:14:50,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:14:50,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:14:50,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:14:50,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:14:50,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:14:50,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:14:50,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:14:50,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:14:50,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:14:50,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:14:50,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:14:50,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:14:50,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 17:14:50,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:14:50,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:14:50,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:14:50,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:14:50,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:14:50,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:14:50,117 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:14:50,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:14:50,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:14:50,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:14:50,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:14:50,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:14:50,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:14:50,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:14:50,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:14:50,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:14:50,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:14:50,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:14:50,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:14:50,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:14:50,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:14:50,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:14:50,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:14:50,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:14:50,123 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:14:50,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:14:50,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:14:50,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:14:50,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:14:50,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:14:50,473 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:14:50,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2022-12-06 17:14:51,689 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:14:51,908 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:14:51,908 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2022-12-06 17:14:51,923 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bff296e/40d6499b2cfe46c0b6a08734187d9f8b/FLAG67fd16701 [2022-12-06 17:14:51,939 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bff296e/40d6499b2cfe46c0b6a08734187d9f8b [2022-12-06 17:14:51,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:14:51,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:14:51,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:14:51,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:14:51,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:14:51,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:51" (1/1) ... [2022-12-06 17:14:51,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bc61bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:51, skipping insertion in model container [2022-12-06 17:14:51,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:51" (1/1) ... [2022-12-06 17:14:51,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:14:51,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:14:52,197 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c[4929,4942] [2022-12-06 17:14:52,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:14:52,227 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:14:52,267 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c[4929,4942] [2022-12-06 17:14:52,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:14:52,301 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:14:52,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52 WrapperNode [2022-12-06 17:14:52,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:14:52,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:14:52,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:14:52,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:14:52,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,364 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 388 [2022-12-06 17:14:52,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:14:52,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:14:52,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:14:52,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:14:52,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,394 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:14:52,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:14:52,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:14:52,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:14:52,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (1/1) ... [2022-12-06 17:14:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:14:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:14:52,436 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) [2022-12-06 17:14:52,441 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 [2022-12-06 17:14:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:14:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:14:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:14:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:14:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:14:52,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:14:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:14:52,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:14:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:14:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 17:14:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:14:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:14:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:14:52,471 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:14:52,567 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:14:52,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:14:53,147 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:14:53,165 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:14:53,165 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 17:14:53,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:53 BoogieIcfgContainer [2022-12-06 17:14:53,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:14:53,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:14:53,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:14:53,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:14:53,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:51" (1/3) ... [2022-12-06 17:14:53,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f591b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:53, skipping insertion in model container [2022-12-06 17:14:53,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:52" (2/3) ... [2022-12-06 17:14:53,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f591b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:53, skipping insertion in model container [2022-12-06 17:14:53,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:53" (3/3) ... [2022-12-06 17:14:53,175 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2022-12-06 17:14:53,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:14:53,192 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:14:53,192 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:14:53,360 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 17:14:53,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 467 transitions, 950 flow [2022-12-06 17:14:53,620 INFO L130 PetriNetUnfolder]: 49/465 cut-off events. [2022-12-06 17:14:53,620 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 17:14:53,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 465 events. 49/465 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1352 event pairs, 0 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 319. Up to 2 conditions per place. [2022-12-06 17:14:53,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 467 transitions, 950 flow [2022-12-06 17:14:53,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 457 transitions, 926 flow [2022-12-06 17:14:53,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:14:53,668 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=LoopsAndPotentialCycles, 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;@d31ba24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:14:53,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 17:14:53,747 INFO L130 PetriNetUnfolder]: 46/442 cut-off events. [2022-12-06 17:14:53,747 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 17:14:53,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:14:53,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:14:53,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:14:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:14:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1266941758, now seen corresponding path program 1 times [2022-12-06 17:14:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:14:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540507832] [2022-12-06 17:14:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:14:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:14:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:14:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540507832] [2022-12-06 17:14:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540507832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:14:54,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:14:54,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:14:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786211164] [2022-12-06 17:14:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:14:54,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:14:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:14:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:14:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:14:54,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2022-12-06 17:14:54,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 457 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:54,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:14:54,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2022-12-06 17:14:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:14:54,725 INFO L130 PetriNetUnfolder]: 127/1507 cut-off events. [2022-12-06 17:14:54,726 INFO L131 PetriNetUnfolder]: For 67/69 co-relation queries the response was YES. [2022-12-06 17:14:54,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 1507 events. 127/1507 cut-off events. For 67/69 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11244 event pairs, 36 based on Foata normal form. 123/1458 useless extension candidates. Maximal degree in co-relation 1393. Up to 87 conditions per place. [2022-12-06 17:14:54,742 INFO L137 encePairwiseOnDemand]: 436/467 looper letters, 27 selfloop transitions, 4 changer transitions 5/445 dead transitions. [2022-12-06 17:14:54,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 445 transitions, 973 flow [2022-12-06 17:14:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:14:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:14:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1346 transitions. [2022-12-06 17:14:54,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9607423269093505 [2022-12-06 17:14:54,769 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 2 predicate places. [2022-12-06 17:14:54,769 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 445 transitions, 973 flow [2022-12-06 17:14:54,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:54,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:14:54,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:14:54,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:14:54,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:14:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:14:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2133043390, now seen corresponding path program 2 times [2022-12-06 17:14:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:14:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570931753] [2022-12-06 17:14:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:14:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:14:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:14:54,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570931753] [2022-12-06 17:14:54,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570931753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:14:54,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:14:54,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:14:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059418711] [2022-12-06 17:14:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:14:54,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:14:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:14:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:14:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:14:54,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2022-12-06 17:14:54,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 445 transitions, 973 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:54,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:14:54,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2022-12-06 17:14:54,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:14:55,180 INFO L130 PetriNetUnfolder]: 119/1448 cut-off events. [2022-12-06 17:14:55,181 INFO L131 PetriNetUnfolder]: For 204/250 co-relation queries the response was YES. [2022-12-06 17:14:55,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 1448 events. 119/1448 cut-off events. For 204/250 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10813 event pairs, 26 based on Foata normal form. 2/1295 useless extension candidates. Maximal degree in co-relation 1391. Up to 101 conditions per place. [2022-12-06 17:14:55,193 INFO L137 encePairwiseOnDemand]: 461/467 looper letters, 40 selfloop transitions, 4 changer transitions 5/458 dead transitions. [2022-12-06 17:14:55,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 458 transitions, 1122 flow [2022-12-06 17:14:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:14:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:14:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2022-12-06 17:14:55,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2022-12-06 17:14:55,197 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 4 predicate places. [2022-12-06 17:14:55,197 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 458 transitions, 1122 flow [2022-12-06 17:14:55,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:55,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:14:55,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:14:55,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:14:55,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:14:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:14:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash -385009255, now seen corresponding path program 1 times [2022-12-06 17:14:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:14:55,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556272314] [2022-12-06 17:14:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:14:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:14:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:14:55,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556272314] [2022-12-06 17:14:55,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556272314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:14:55,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:14:55,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:14:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174729785] [2022-12-06 17:14:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:14:55,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:14:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:14:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:14:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:14:55,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 467 [2022-12-06 17:14:55,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 458 transitions, 1122 flow. Second operand has 5 states, 5 states have (on average 418.6) internal successors, (2093), 5 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:55,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:14:55,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 467 [2022-12-06 17:14:55,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:14:55,747 INFO L130 PetriNetUnfolder]: 119/1458 cut-off events. [2022-12-06 17:14:55,747 INFO L131 PetriNetUnfolder]: For 372/427 co-relation queries the response was YES. [2022-12-06 17:14:55,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 1458 events. 119/1458 cut-off events. For 372/427 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10813 event pairs, 26 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 1398. Up to 101 conditions per place. [2022-12-06 17:14:55,758 INFO L137 encePairwiseOnDemand]: 457/467 looper letters, 32 selfloop transitions, 8 changer transitions 5/466 dead transitions. [2022-12-06 17:14:55,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 466 transitions, 1218 flow [2022-12-06 17:14:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:14:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:14:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2111 transitions. [2022-12-06 17:14:55,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9040685224839401 [2022-12-06 17:14:55,768 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 8 predicate places. [2022-12-06 17:14:55,768 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 466 transitions, 1218 flow [2022-12-06 17:14:55,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 418.6) internal successors, (2093), 5 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:55,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:14:55,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:14:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:14:55,771 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:14:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:14:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 951760927, now seen corresponding path program 1 times [2022-12-06 17:14:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:14:55,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987072671] [2022-12-06 17:14:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:14:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:14:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:14:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987072671] [2022-12-06 17:14:55,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987072671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:14:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157939477] [2022-12-06 17:14:55,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:14:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:14:56,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:14:56,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 17:14:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:56,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 17:14:56,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:14:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:14:56,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:14:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:14:56,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157939477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:14:56,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:14:56,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 17:14:56,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105471794] [2022-12-06 17:14:56,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:14:56,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 17:14:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:14:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 17:14:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-06 17:14:56,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2022-12-06 17:14:56,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 466 transitions, 1218 flow. Second operand has 15 states, 15 states have (on average 416.1333333333333) internal successors, (6242), 15 states have internal predecessors, (6242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:56,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:14:56,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2022-12-06 17:14:56,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:14:56,781 INFO L130 PetriNetUnfolder]: 119/1474 cut-off events. [2022-12-06 17:14:56,782 INFO L131 PetriNetUnfolder]: For 590/653 co-relation queries the response was YES. [2022-12-06 17:14:56,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 1474 events. 119/1474 cut-off events. For 590/653 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10815 event pairs, 26 based on Foata normal form. 2/1321 useless extension candidates. Maximal degree in co-relation 1416. Up to 101 conditions per place. [2022-12-06 17:14:56,796 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 34 selfloop transitions, 22 changer transitions 5/480 dead transitions. [2022-12-06 17:14:56,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 480 transitions, 1378 flow [2022-12-06 17:14:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 17:14:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 17:14:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4597 transitions. [2022-12-06 17:14:56,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8948802803192525 [2022-12-06 17:14:56,807 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 18 predicate places. [2022-12-06 17:14:56,807 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 480 transitions, 1378 flow [2022-12-06 17:14:56,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 416.1333333333333) internal successors, (6242), 15 states have internal predecessors, (6242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:56,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:14:56,811 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:14:56,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 17:14:57,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:14:57,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:14:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:14:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 67100395, now seen corresponding path program 2 times [2022-12-06 17:14:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:14:57,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332587023] [2022-12-06 17:14:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:14:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-06 17:14:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:14:57,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332587023] [2022-12-06 17:14:57,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332587023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:14:57,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945653728] [2022-12-06 17:14:57,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:14:57,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:14:57,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:14:57,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:14:57,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 17:14:57,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 17:14:57,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:14:57,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 17:14:57,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:14:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-06 17:14:57,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 17:14:57,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945653728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:14:57,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 17:14:57,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-12-06 17:14:57,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86177066] [2022-12-06 17:14:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:14:57,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:14:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:14:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:14:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-12-06 17:14:57,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:14:57,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 480 transitions, 1378 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:57,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:14:57,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:14:57,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:14:58,473 INFO L130 PetriNetUnfolder]: 499/2982 cut-off events. [2022-12-06 17:14:58,473 INFO L131 PetriNetUnfolder]: For 1700/1730 co-relation queries the response was YES. [2022-12-06 17:14:58,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 2982 events. 499/2982 cut-off events. For 1700/1730 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 24178 event pairs, 212 based on Foata normal form. 0/2639 useless extension candidates. Maximal degree in co-relation 3757. Up to 600 conditions per place. [2022-12-06 17:14:58,496 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 107 selfloop transitions, 5 changer transitions 29/561 dead transitions. [2022-12-06 17:14:58,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 561 transitions, 1943 flow [2022-12-06 17:14:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 17:14:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 17:14:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 7876 transitions. [2022-12-06 17:14:58,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8432548179871521 [2022-12-06 17:14:58,515 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 37 predicate places. [2022-12-06 17:14:58,515 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 561 transitions, 1943 flow [2022-12-06 17:14:58,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:58,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:14:58,518 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:14:58,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 17:14:58,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:14:58,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:14:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:14:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1115785851, now seen corresponding path program 3 times [2022-12-06 17:14:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:14:58,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969934248] [2022-12-06 17:14:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:14:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:14:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:14:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-06 17:14:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:14:58,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969934248] [2022-12-06 17:14:58,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969934248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:14:58,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755688632] [2022-12-06 17:14:58,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:14:58,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:14:58,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:14:58,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:14:58,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 17:14:59,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 17:14:59,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:14:59,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 17:14:59,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:14:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-06 17:14:59,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 17:14:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755688632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:14:59,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 17:14:59,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-12-06 17:14:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626976111] [2022-12-06 17:14:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:14:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:14:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:14:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:14:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-12-06 17:14:59,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:14:59,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 561 transitions, 1943 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:14:59,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:14:59,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:14:59,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:00,133 INFO L130 PetriNetUnfolder]: 526/3308 cut-off events. [2022-12-06 17:15:00,133 INFO L131 PetriNetUnfolder]: For 2539/3135 co-relation queries the response was YES. [2022-12-06 17:15:00,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5800 conditions, 3308 events. 526/3308 cut-off events. For 2539/3135 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 27585 event pairs, 184 based on Foata normal form. 0/2944 useless extension candidates. Maximal degree in co-relation 4875. Up to 665 conditions per place. [2022-12-06 17:15:00,193 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 167 selfloop transitions, 15 changer transitions 53/655 dead transitions. [2022-12-06 17:15:00,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 655 transitions, 2899 flow [2022-12-06 17:15:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 17:15:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 17:15:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 7472 transitions. [2022-12-06 17:15:00,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2022-12-06 17:15:00,209 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 55 predicate places. [2022-12-06 17:15:00,209 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 655 transitions, 2899 flow [2022-12-06 17:15:00,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:00,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:00,212 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:00,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 17:15:00,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:15:00,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash -374050077, now seen corresponding path program 4 times [2022-12-06 17:15:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:00,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030659260] [2022-12-06 17:15:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:00,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-06 17:15:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:00,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030659260] [2022-12-06 17:15:00,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030659260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:15:00,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426028943] [2022-12-06 17:15:00,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:15:00,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:15:00,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:15:00,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:15:00,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 17:15:00,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:15:00,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:15:00,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 17:15:00,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:15:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-06 17:15:00,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:15:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-06 17:15:01,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426028943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:15:01,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:15:01,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-12-06 17:15:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349019445] [2022-12-06 17:15:01,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:15:01,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 17:15:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:01,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 17:15:01,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-12-06 17:15:01,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2022-12-06 17:15:01,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 655 transitions, 2899 flow. Second operand has 22 states, 22 states have (on average 416.04545454545456) internal successors, (9153), 22 states have internal predecessors, (9153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:01,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:01,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2022-12-06 17:15:01,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:01,900 INFO L130 PetriNetUnfolder]: 519/3229 cut-off events. [2022-12-06 17:15:01,900 INFO L131 PetriNetUnfolder]: For 3295/3923 co-relation queries the response was YES. [2022-12-06 17:15:01,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 3229 events. 519/3229 cut-off events. For 3295/3923 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 26540 event pairs, 183 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 4835. Up to 667 conditions per place. [2022-12-06 17:15:01,922 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 56 selfloop transitions, 34 changer transitions 53/675 dead transitions. [2022-12-06 17:15:01,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 675 transitions, 3205 flow [2022-12-06 17:15:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 17:15:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 17:15:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7095 transitions. [2022-12-06 17:15:01,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8936893815341983 [2022-12-06 17:15:01,935 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 71 predicate places. [2022-12-06 17:15:01,936 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 675 transitions, 3205 flow [2022-12-06 17:15:01,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 416.04545454545456) internal successors, (9153), 22 states have internal predecessors, (9153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:01,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:01,939 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:01,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 17:15:02,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:15:02,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 879296943, now seen corresponding path program 5 times [2022-12-06 17:15:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:02,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761965211] [2022-12-06 17:15:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:02,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:02,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761965211] [2022-12-06 17:15:02,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761965211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:02,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:02,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274071246] [2022-12-06 17:15:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:02,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:02,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:02,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:02,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 675 transitions, 3205 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:02,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:02,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:02,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:03,544 INFO L130 PetriNetUnfolder]: 525/3277 cut-off events. [2022-12-06 17:15:03,545 INFO L131 PetriNetUnfolder]: For 4632/7040 co-relation queries the response was YES. [2022-12-06 17:15:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6912 conditions, 3277 events. 525/3277 cut-off events. For 4632/7040 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 27208 event pairs, 183 based on Foata normal form. 70/2997 useless extension candidates. Maximal degree in co-relation 5686. Up to 697 conditions per place. [2022-12-06 17:15:03,619 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 168 selfloop transitions, 20 changer transitions 71/699 dead transitions. [2022-12-06 17:15:03,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 699 transitions, 3906 flow [2022-12-06 17:15:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 17:15:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 17:15:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 5517 transitions. [2022-12-06 17:15:03,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8438360354848577 [2022-12-06 17:15:03,630 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 84 predicate places. [2022-12-06 17:15:03,630 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 699 transitions, 3906 flow [2022-12-06 17:15:03,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:03,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:03,632 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:03,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:15:03,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2015802991, now seen corresponding path program 6 times [2022-12-06 17:15:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413488819] [2022-12-06 17:15:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:03,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:03,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413488819] [2022-12-06 17:15:03,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413488819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:03,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:03,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660240299] [2022-12-06 17:15:03,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:03,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:03,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:03,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:03,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 699 transitions, 3906 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:03,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:03,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:03,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:04,722 INFO L130 PetriNetUnfolder]: 537/3411 cut-off events. [2022-12-06 17:15:04,722 INFO L131 PetriNetUnfolder]: For 6130/8234 co-relation queries the response was YES. [2022-12-06 17:15:04,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8012 conditions, 3411 events. 537/3411 cut-off events. For 6130/8234 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 28563 event pairs, 184 based on Foata normal form. 58/3105 useless extension candidates. Maximal degree in co-relation 6637. Up to 711 conditions per place. [2022-12-06 17:15:04,757 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 167 selfloop transitions, 14 changer transitions 93/714 dead transitions. [2022-12-06 17:15:04,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 714 transitions, 4626 flow [2022-12-06 17:15:04,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 17:15:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 17:15:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6685 transitions. [2022-12-06 17:15:04,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8420455976823278 [2022-12-06 17:15:04,772 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 100 predicate places. [2022-12-06 17:15:04,772 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 714 transitions, 4626 flow [2022-12-06 17:15:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:04,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:04,774 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:04,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 17:15:04,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -99849287, now seen corresponding path program 7 times [2022-12-06 17:15:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:04,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318123966] [2022-12-06 17:15:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:05,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:05,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318123966] [2022-12-06 17:15:05,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318123966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:05,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:05,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:05,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419247105] [2022-12-06 17:15:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:05,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:05,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:05,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:05,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:05,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 714 transitions, 4626 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:05,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:05,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:05,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:05,874 INFO L130 PetriNetUnfolder]: 528/3307 cut-off events. [2022-12-06 17:15:05,874 INFO L131 PetriNetUnfolder]: For 8229/11085 co-relation queries the response was YES. [2022-12-06 17:15:05,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8987 conditions, 3307 events. 528/3307 cut-off events. For 8229/11085 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 27807 event pairs, 182 based on Foata normal form. 33/3003 useless extension candidates. Maximal degree in co-relation 7453. Up to 724 conditions per place. [2022-12-06 17:15:05,900 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 181 selfloop transitions, 16 changer transitions 114/751 dead transitions. [2022-12-06 17:15:05,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 751 transitions, 5657 flow [2022-12-06 17:15:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 17:15:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 17:15:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6291 transitions. [2022-12-06 17:15:05,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8419432548179872 [2022-12-06 17:15:05,908 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 115 predicate places. [2022-12-06 17:15:05,908 INFO L495 AbstractCegarLoop]: Abstraction has has 530 places, 751 transitions, 5657 flow [2022-12-06 17:15:05,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:05,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:05,909 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:05,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 17:15:05,910 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -301819607, now seen corresponding path program 8 times [2022-12-06 17:15:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:05,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157313666] [2022-12-06 17:15:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:06,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157313666] [2022-12-06 17:15:06,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157313666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:06,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:06,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063275012] [2022-12-06 17:15:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:06,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:06,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:06,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:06,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 751 transitions, 5657 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:06,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:06,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:06,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:07,188 INFO L130 PetriNetUnfolder]: 550/3517 cut-off events. [2022-12-06 17:15:07,188 INFO L131 PetriNetUnfolder]: For 10989/14729 co-relation queries the response was YES. [2022-12-06 17:15:07,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10302 conditions, 3517 events. 550/3517 cut-off events. For 10989/14729 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 29939 event pairs, 184 based on Foata normal form. 24/3179 useless extension candidates. Maximal degree in co-relation 8599. Up to 740 conditions per place. [2022-12-06 17:15:07,224 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 178 selfloop transitions, 16 changer transitions 135/769 dead transitions. [2022-12-06 17:15:07,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 769 transitions, 6596 flow [2022-12-06 17:15:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 17:15:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 17:15:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6293 transitions. [2022-12-06 17:15:07,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8422109207708779 [2022-12-06 17:15:07,232 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 130 predicate places. [2022-12-06 17:15:07,232 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 769 transitions, 6596 flow [2022-12-06 17:15:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:07,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:07,233 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 17:15:07,234 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:07,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1642283691, now seen corresponding path program 9 times [2022-12-06 17:15:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:07,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517843935] [2022-12-06 17:15:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:07,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:07,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517843935] [2022-12-06 17:15:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517843935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:07,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:07,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700546132] [2022-12-06 17:15:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:07,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:07,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:07,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:07,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:07,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 769 transitions, 6596 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:07,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:07,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:07,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:08,503 INFO L130 PetriNetUnfolder]: 531/3361 cut-off events. [2022-12-06 17:15:08,504 INFO L131 PetriNetUnfolder]: For 13943/18578 co-relation queries the response was YES. [2022-12-06 17:15:08,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11122 conditions, 3361 events. 531/3361 cut-off events. For 13943/18578 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 28410 event pairs, 182 based on Foata normal form. 34/3058 useless extension candidates. Maximal degree in co-relation 9240. Up to 745 conditions per place. [2022-12-06 17:15:08,540 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 174 selfloop transitions, 6 changer transitions 155/775 dead transitions. [2022-12-06 17:15:08,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 775 transitions, 7376 flow [2022-12-06 17:15:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:15:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:15:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5902 transitions. [2022-12-06 17:15:08,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8425410421127766 [2022-12-06 17:15:08,550 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 144 predicate places. [2022-12-06 17:15:08,550 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 775 transitions, 7376 flow [2022-12-06 17:15:08,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:08,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:08,552 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:08,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 17:15:08,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 193057809, now seen corresponding path program 10 times [2022-12-06 17:15:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:08,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699882575] [2022-12-06 17:15:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:08,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699882575] [2022-12-06 17:15:08,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699882575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:08,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:08,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886045753] [2022-12-06 17:15:08,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:08,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:08,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:08,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:08,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 775 transitions, 7376 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:08,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:08,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:08,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:09,733 INFO L130 PetriNetUnfolder]: 558/3630 cut-off events. [2022-12-06 17:15:09,733 INFO L131 PetriNetUnfolder]: For 17412/22626 co-relation queries the response was YES. [2022-12-06 17:15:09,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12497 conditions, 3630 events. 558/3630 cut-off events. For 17412/22626 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 31163 event pairs, 185 based on Foata normal form. 20/3278 useless extension candidates. Maximal degree in co-relation 10426. Up to 804 conditions per place. [2022-12-06 17:15:09,763 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 160 selfloop transitions, 13 changer transitions 176/789 dead transitions. [2022-12-06 17:15:09,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 789 transitions, 8337 flow [2022-12-06 17:15:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:15:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:15:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5903 transitions. [2022-12-06 17:15:09,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8426837972876516 [2022-12-06 17:15:09,770 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 158 predicate places. [2022-12-06 17:15:09,770 INFO L495 AbstractCegarLoop]: Abstraction has has 573 places, 789 transitions, 8337 flow [2022-12-06 17:15:09,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:09,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:09,771 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:09,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 17:15:09,772 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 362957761, now seen corresponding path program 11 times [2022-12-06 17:15:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:09,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859883177] [2022-12-06 17:15:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:10,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859883177] [2022-12-06 17:15:10,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859883177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:10,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:10,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151192365] [2022-12-06 17:15:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:10,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:10,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:10,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:10,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:10,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 789 transitions, 8337 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:10,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:10,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:10,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:10,879 INFO L130 PetriNetUnfolder]: 552/3611 cut-off events. [2022-12-06 17:15:10,879 INFO L131 PetriNetUnfolder]: For 20948/27308 co-relation queries the response was YES. [2022-12-06 17:15:10,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13627 conditions, 3611 events. 552/3611 cut-off events. For 20948/27308 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 31330 event pairs, 183 based on Foata normal form. 24/3273 useless extension candidates. Maximal degree in co-relation 11357. Up to 817 conditions per place. [2022-12-06 17:15:10,909 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 159 selfloop transitions, 10 changer transitions 197/806 dead transitions. [2022-12-06 17:15:10,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 806 transitions, 9414 flow [2022-12-06 17:15:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 17:15:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 17:15:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6680 transitions. [2022-12-06 17:15:10,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8414157954402318 [2022-12-06 17:15:10,918 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 174 predicate places. [2022-12-06 17:15:10,918 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 806 transitions, 9414 flow [2022-12-06 17:15:10,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:10,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:10,920 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:10,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 17:15:10,920 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1981534645, now seen corresponding path program 12 times [2022-12-06 17:15:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:10,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230227607] [2022-12-06 17:15:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230227607] [2022-12-06 17:15:11,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230227607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:11,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:11,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352196863] [2022-12-06 17:15:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:11,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:11,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 806 transitions, 9414 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:11,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:11,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:11,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:12,083 INFO L130 PetriNetUnfolder]: 520/3282 cut-off events. [2022-12-06 17:15:12,083 INFO L131 PetriNetUnfolder]: For 24568/32950 co-relation queries the response was YES. [2022-12-06 17:15:12,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14175 conditions, 3282 events. 520/3282 cut-off events. For 24568/32950 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 28101 event pairs, 182 based on Foata normal form. 28/2995 useless extension candidates. Maximal degree in co-relation 11771. Up to 806 conditions per place. [2022-12-06 17:15:12,111 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 147 selfloop transitions, 2 changer transitions 218/805 dead transitions. [2022-12-06 17:15:12,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 805 transitions, 10124 flow [2022-12-06 17:15:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:15:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:15:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5901 transitions. [2022-12-06 17:15:12,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8423982869379015 [2022-12-06 17:15:12,119 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 188 predicate places. [2022-12-06 17:15:12,119 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 805 transitions, 10124 flow [2022-12-06 17:15:12,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:12,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:12,120 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:12,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 17:15:12,120 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -722015891, now seen corresponding path program 1 times [2022-12-06 17:15:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:12,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024996755] [2022-12-06 17:15:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024996755] [2022-12-06 17:15:12,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024996755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:12,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:12,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606163818] [2022-12-06 17:15:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:12,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:12,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:12,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 805 transitions, 10124 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:12,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:12,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:13,462 INFO L130 PetriNetUnfolder]: 695/4210 cut-off events. [2022-12-06 17:15:13,462 INFO L131 PetriNetUnfolder]: For 38155/46644 co-relation queries the response was YES. [2022-12-06 17:15:13,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18298 conditions, 4210 events. 695/4210 cut-off events. For 38155/46644 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 37332 event pairs, 217 based on Foata normal form. 28/3832 useless extension candidates. Maximal degree in co-relation 15587. Up to 988 conditions per place. [2022-12-06 17:15:13,495 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 181 selfloop transitions, 3 changer transitions 244/873 dead transitions. [2022-12-06 17:15:13,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 873 transitions, 12341 flow [2022-12-06 17:15:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 17:15:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 17:15:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 7476 transitions. [2022-12-06 17:15:13,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8425560689732897 [2022-12-06 17:15:13,504 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 206 predicate places. [2022-12-06 17:15:13,504 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 873 transitions, 12341 flow [2022-12-06 17:15:13,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:13,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:13,506 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:13,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 17:15:13,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -343121399, now seen corresponding path program 2 times [2022-12-06 17:15:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:13,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859529763] [2022-12-06 17:15:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:13,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859529763] [2022-12-06 17:15:13,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859529763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:13,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:13,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113230687] [2022-12-06 17:15:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:13,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:13,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:13,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:13,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 873 transitions, 12341 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:13,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:13,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:13,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:15,029 INFO L130 PetriNetUnfolder]: 707/4178 cut-off events. [2022-12-06 17:15:15,030 INFO L131 PetriNetUnfolder]: For 46197/55276 co-relation queries the response was YES. [2022-12-06 17:15:15,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20341 conditions, 4178 events. 707/4178 cut-off events. For 46197/55276 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 37704 event pairs, 193 based on Foata normal form. 12/3804 useless extension candidates. Maximal degree in co-relation 17318. Up to 1050 conditions per place. [2022-12-06 17:15:15,069 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 253 selfloop transitions, 18 changer transitions 269/985 dead transitions. [2022-12-06 17:15:15,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 985 transitions, 16106 flow [2022-12-06 17:15:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 17:15:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 17:15:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 7875 transitions. [2022-12-06 17:15:15,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8431477516059958 [2022-12-06 17:15:15,079 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 225 predicate places. [2022-12-06 17:15:15,079 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 985 transitions, 16106 flow [2022-12-06 17:15:15,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:15,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:15,080 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:15,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 17:15:15,081 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:15,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1578762067, now seen corresponding path program 3 times [2022-12-06 17:15:15,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:15,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083062728] [2022-12-06 17:15:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:15,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083062728] [2022-12-06 17:15:15,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083062728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:15,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:15,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450262309] [2022-12-06 17:15:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:15,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:15,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:15,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 985 transitions, 16106 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:15,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:15,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:15,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:16,228 INFO L130 PetriNetUnfolder]: 734/4314 cut-off events. [2022-12-06 17:15:16,229 INFO L131 PetriNetUnfolder]: For 53885/64446 co-relation queries the response was YES. [2022-12-06 17:15:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22502 conditions, 4314 events. 734/4314 cut-off events. For 53885/64446 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 39223 event pairs, 185 based on Foata normal form. 42/3968 useless extension candidates. Maximal degree in co-relation 19238. Up to 1142 conditions per place. [2022-12-06 17:15:16,261 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 271 selfloop transitions, 19 changer transitions 293/1028 dead transitions. [2022-12-06 17:15:16,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 1028 transitions, 18349 flow [2022-12-06 17:15:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 17:15:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 17:15:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6683 transitions. [2022-12-06 17:15:16,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8417936767854893 [2022-12-06 17:15:16,268 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 241 predicate places. [2022-12-06 17:15:16,268 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 1028 transitions, 18349 flow [2022-12-06 17:15:16,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:16,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:16,269 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:16,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 17:15:16,269 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -239965925, now seen corresponding path program 4 times [2022-12-06 17:15:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:16,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652751987] [2022-12-06 17:15:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:16,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:16,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652751987] [2022-12-06 17:15:16,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652751987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:16,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:16,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368162244] [2022-12-06 17:15:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:16,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:16,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 1028 transitions, 18349 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:16,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:16,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:16,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:17,572 INFO L130 PetriNetUnfolder]: 723/4227 cut-off events. [2022-12-06 17:15:17,572 INFO L131 PetriNetUnfolder]: For 62360/74691 co-relation queries the response was YES. [2022-12-06 17:15:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23986 conditions, 4227 events. 723/4227 cut-off events. For 62360/74691 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 38655 event pairs, 190 based on Foata normal form. 36/3889 useless extension candidates. Maximal degree in co-relation 20471. Up to 1180 conditions per place. [2022-12-06 17:15:17,608 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 268 selfloop transitions, 18 changer transitions 314/1045 dead transitions. [2022-12-06 17:15:17,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 1045 transitions, 19979 flow [2022-12-06 17:15:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:15:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:15:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5901 transitions. [2022-12-06 17:15:17,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8423982869379015 [2022-12-06 17:15:17,614 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 255 predicate places. [2022-12-06 17:15:17,615 INFO L495 AbstractCegarLoop]: Abstraction has has 670 places, 1045 transitions, 19979 flow [2022-12-06 17:15:17,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:17,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:17,616 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:17,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 17:15:17,616 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash 445573739, now seen corresponding path program 5 times [2022-12-06 17:15:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:17,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346575504] [2022-12-06 17:15:17,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346575504] [2022-12-06 17:15:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346575504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:17,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:17,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297332325] [2022-12-06 17:15:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:17,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:17,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:17,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 1045 transitions, 19979 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:17,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:17,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:17,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:18,958 INFO L130 PetriNetUnfolder]: 718/4195 cut-off events. [2022-12-06 17:15:18,958 INFO L131 PetriNetUnfolder]: For 71210/85204 co-relation queries the response was YES. [2022-12-06 17:15:18,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25398 conditions, 4195 events. 718/4195 cut-off events. For 71210/85204 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 38380 event pairs, 191 based on Foata normal form. 38/3868 useless extension candidates. Maximal degree in co-relation 21622. Up to 1185 conditions per place. [2022-12-06 17:15:18,992 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 261 selfloop transitions, 9 changer transitions 336/1051 dead transitions. [2022-12-06 17:15:18,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 1051 transitions, 21339 flow [2022-12-06 17:15:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:15:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:15:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5902 transitions. [2022-12-06 17:15:19,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8425410421127766 [2022-12-06 17:15:19,001 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 269 predicate places. [2022-12-06 17:15:19,002 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 1051 transitions, 21339 flow [2022-12-06 17:15:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:19,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:19,003 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:19,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 17:15:19,003 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -736983647, now seen corresponding path program 6 times [2022-12-06 17:15:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:19,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606578771] [2022-12-06 17:15:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606578771] [2022-12-06 17:15:19,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606578771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:19,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:19,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942267575] [2022-12-06 17:15:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:19,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:19,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:19,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 1051 transitions, 21339 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:19,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:19,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:19,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:20,443 INFO L130 PetriNetUnfolder]: 737/4345 cut-off events. [2022-12-06 17:15:20,443 INFO L131 PetriNetUnfolder]: For 81188/97006 co-relation queries the response was YES. [2022-12-06 17:15:20,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27388 conditions, 4345 events. 737/4345 cut-off events. For 81188/97006 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 40059 event pairs, 190 based on Foata normal form. 81/4048 useless extension candidates. Maximal degree in co-relation 23341. Up to 1206 conditions per place. [2022-12-06 17:15:20,475 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 257 selfloop transitions, 21 changer transitions 357/1080 dead transitions. [2022-12-06 17:15:20,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 1080 transitions, 23451 flow [2022-12-06 17:15:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 17:15:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 17:15:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6685 transitions. [2022-12-06 17:15:20,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8420455976823278 [2022-12-06 17:15:20,481 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 285 predicate places. [2022-12-06 17:15:20,481 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 1080 transitions, 23451 flow [2022-12-06 17:15:20,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:20,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:20,483 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:20,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 17:15:20,483 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 300183671, now seen corresponding path program 7 times [2022-12-06 17:15:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:20,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538093107] [2022-12-06 17:15:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:20,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538093107] [2022-12-06 17:15:20,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538093107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:20,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:20,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345430863] [2022-12-06 17:15:20,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:20,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:20,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:20,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:20,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:20,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 1080 transitions, 23451 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:20,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:20,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:20,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:21,761 INFO L130 PetriNetUnfolder]: 739/4367 cut-off events. [2022-12-06 17:15:21,761 INFO L131 PetriNetUnfolder]: For 91264/107210 co-relation queries the response was YES. [2022-12-06 17:15:21,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29078 conditions, 4367 events. 739/4367 cut-off events. For 91264/107210 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 40512 event pairs, 191 based on Foata normal form. 91/4079 useless extension candidates. Maximal degree in co-relation 24750. Up to 1221 conditions per place. [2022-12-06 17:15:21,798 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 256 selfloop transitions, 13 changer transitions 378/1092 dead transitions. [2022-12-06 17:15:21,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 1092 transitions, 25140 flow [2022-12-06 17:15:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 17:15:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 17:15:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 5520 transitions. [2022-12-06 17:15:21,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8442948914040991 [2022-12-06 17:15:21,803 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 298 predicate places. [2022-12-06 17:15:21,803 INFO L495 AbstractCegarLoop]: Abstraction has has 713 places, 1092 transitions, 25140 flow [2022-12-06 17:15:21,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:21,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:21,804 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 17:15:21,805 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1522133293, now seen corresponding path program 8 times [2022-12-06 17:15:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:21,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848962875] [2022-12-06 17:15:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:22,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:22,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848962875] [2022-12-06 17:15:22,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848962875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:22,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:22,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107170972] [2022-12-06 17:15:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:22,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:22,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:22,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:22,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:22,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 1092 transitions, 25140 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:22,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:22,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:22,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:23,423 INFO L130 PetriNetUnfolder]: 719/4136 cut-off events. [2022-12-06 17:15:23,423 INFO L131 PetriNetUnfolder]: For 104455/123378 co-relation queries the response was YES. [2022-12-06 17:15:23,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30563 conditions, 4136 events. 719/4136 cut-off events. For 104455/123378 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 38283 event pairs, 187 based on Foata normal form. 47/3849 useless extension candidates. Maximal degree in co-relation 25944. Up to 1232 conditions per place. [2022-12-06 17:15:23,453 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 249 selfloop transitions, 14 changer transitions 399/1107 dead transitions. [2022-12-06 17:15:23,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 1107 transitions, 26958 flow [2022-12-06 17:15:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 17:15:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 17:15:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6292 transitions. [2022-12-06 17:15:23,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8420770877944326 [2022-12-06 17:15:23,458 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 313 predicate places. [2022-12-06 17:15:23,458 INFO L495 AbstractCegarLoop]: Abstraction has has 728 places, 1107 transitions, 26958 flow [2022-12-06 17:15:23,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:23,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:23,459 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:23,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 17:15:23,460 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 584444619, now seen corresponding path program 9 times [2022-12-06 17:15:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:23,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954990429] [2022-12-06 17:15:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:23,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954990429] [2022-12-06 17:15:23,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954990429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:23,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:23,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67892640] [2022-12-06 17:15:23,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:23,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:23,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:23,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 1107 transitions, 26958 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:23,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:23,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:24,781 INFO L130 PetriNetUnfolder]: 748/4417 cut-off events. [2022-12-06 17:15:24,781 INFO L131 PetriNetUnfolder]: For 116386/135458 co-relation queries the response was YES. [2022-12-06 17:15:24,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32765 conditions, 4417 events. 748/4417 cut-off events. For 116386/135458 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 41455 event pairs, 193 based on Foata normal form. 50/4099 useless extension candidates. Maximal degree in co-relation 27845. Up to 1255 conditions per place. [2022-12-06 17:15:24,821 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 250 selfloop transitions, 11 changer transitions 420/1126 dead transitions. [2022-12-06 17:15:24,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 1126 transitions, 29009 flow [2022-12-06 17:15:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:15:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:15:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5905 transitions. [2022-12-06 17:15:24,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8429693076374019 [2022-12-06 17:15:24,825 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 327 predicate places. [2022-12-06 17:15:24,825 INFO L495 AbstractCegarLoop]: Abstraction has has 742 places, 1126 transitions, 29009 flow [2022-12-06 17:15:24,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:24,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:24,826 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:24,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 17:15:24,826 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1136021449, now seen corresponding path program 10 times [2022-12-06 17:15:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:24,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575938459] [2022-12-06 17:15:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575938459] [2022-12-06 17:15:25,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575938459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:25,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:25,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 17:15:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721915892] [2022-12-06 17:15:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:25,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:15:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:15:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 17:15:25,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 467 [2022-12-06 17:15:25,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 1126 transitions, 29009 flow. Second operand has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:25,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:25,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 467 [2022-12-06 17:15:25,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:26,472 INFO L130 PetriNetUnfolder]: 731/4222 cut-off events. [2022-12-06 17:15:26,472 INFO L131 PetriNetUnfolder]: For 129617/151753 co-relation queries the response was YES. [2022-12-06 17:15:26,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33963 conditions, 4222 events. 731/4222 cut-off events. For 129617/151753 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 39351 event pairs, 193 based on Foata normal form. 53/3933 useless extension candidates. Maximal degree in co-relation 28867. Up to 1255 conditions per place. [2022-12-06 17:15:26,505 INFO L137 encePairwiseOnDemand]: 451/467 looper letters, 234 selfloop transitions, 2 changer transitions 446/1125 dead transitions. [2022-12-06 17:15:26,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 1125 transitions, 30271 flow [2022-12-06 17:15:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 17:15:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 17:15:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6295 transitions. [2022-12-06 17:15:26,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8424785867237687 [2022-12-06 17:15:26,509 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 342 predicate places. [2022-12-06 17:15:26,509 INFO L495 AbstractCegarLoop]: Abstraction has has 757 places, 1125 transitions, 30271 flow [2022-12-06 17:15:26,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 391.0) internal successors, (3519), 9 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:26,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:26,510 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 17:15:26,511 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -584528930, now seen corresponding path program 1 times [2022-12-06 17:15:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:26,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698902843] [2022-12-06 17:15:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:26,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698902843] [2022-12-06 17:15:26,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698902843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:26,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:26,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:15:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681548114] [2022-12-06 17:15:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:26,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:15:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:15:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:15:26,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2022-12-06 17:15:26,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 1125 transitions, 30271 flow. Second operand has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:26,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:26,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2022-12-06 17:15:26,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:27,764 INFO L130 PetriNetUnfolder]: 838/5033 cut-off events. [2022-12-06 17:15:27,764 INFO L131 PetriNetUnfolder]: For 157037/183103 co-relation queries the response was YES. [2022-12-06 17:15:27,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38310 conditions, 5033 events. 838/5033 cut-off events. For 157037/183103 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 47227 event pairs, 237 based on Foata normal form. 2/4596 useless extension candidates. Maximal degree in co-relation 32114. Up to 1404 conditions per place. [2022-12-06 17:15:27,811 INFO L137 encePairwiseOnDemand]: 462/467 looper letters, 59 selfloop transitions, 4 changer transitions 446/1144 dead transitions. [2022-12-06 17:15:27,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 1144 transitions, 31396 flow [2022-12-06 17:15:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:15:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:15:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-12-06 17:15:27,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9243397573162027 [2022-12-06 17:15:27,813 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 344 predicate places. [2022-12-06 17:15:27,813 INFO L495 AbstractCegarLoop]: Abstraction has has 759 places, 1144 transitions, 31396 flow [2022-12-06 17:15:27,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:27,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:27,813 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:27,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 17:15:27,814 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash 34189312, now seen corresponding path program 1 times [2022-12-06 17:15:27,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:27,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373885932] [2022-12-06 17:15:27,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373885932] [2022-12-06 17:15:27,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373885932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:27,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:27,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:15:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338145518] [2022-12-06 17:15:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:27,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:15:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:15:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:15:27,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2022-12-06 17:15:27,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 1144 transitions, 31396 flow. Second operand has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:27,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:27,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2022-12-06 17:15:27,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:29,672 INFO L130 PetriNetUnfolder]: 973/5935 cut-off events. [2022-12-06 17:15:29,672 INFO L131 PetriNetUnfolder]: For 246849/288568 co-relation queries the response was YES. [2022-12-06 17:15:29,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43037 conditions, 5935 events. 973/5935 cut-off events. For 246849/288568 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 58452 event pairs, 309 based on Foata normal form. 14/5399 useless extension candidates. Maximal degree in co-relation 36273. Up to 1532 conditions per place. [2022-12-06 17:15:29,726 INFO L137 encePairwiseOnDemand]: 462/467 looper letters, 67 selfloop transitions, 4 changer transitions 446/1156 dead transitions. [2022-12-06 17:15:29,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 1156 transitions, 32168 flow [2022-12-06 17:15:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:15:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:15:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2022-12-06 17:15:29,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9236259814418273 [2022-12-06 17:15:29,728 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 346 predicate places. [2022-12-06 17:15:29,728 INFO L495 AbstractCegarLoop]: Abstraction has has 761 places, 1156 transitions, 32168 flow [2022-12-06 17:15:29,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:29,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:29,728 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:29,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 17:15:29,728 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1719046821, now seen corresponding path program 1 times [2022-12-06 17:15:29,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:29,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320585273] [2022-12-06 17:15:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:29,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:29,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320585273] [2022-12-06 17:15:29,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320585273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:29,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:29,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:15:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160107251] [2022-12-06 17:15:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:29,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:15:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:15:29,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:15:29,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2022-12-06 17:15:29,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 1156 transitions, 32168 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:29,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:29,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2022-12-06 17:15:29,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:31,220 INFO L130 PetriNetUnfolder]: 985/6098 cut-off events. [2022-12-06 17:15:31,220 INFO L131 PetriNetUnfolder]: For 305436/361316 co-relation queries the response was YES. [2022-12-06 17:15:31,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45207 conditions, 6098 events. 985/6098 cut-off events. For 305436/361316 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 60143 event pairs, 303 based on Foata normal form. 33/5565 useless extension candidates. Maximal degree in co-relation 37663. Up to 1596 conditions per place. [2022-12-06 17:15:31,272 INFO L137 encePairwiseOnDemand]: 460/467 looper letters, 100 selfloop transitions, 7 changer transitions 446/1178 dead transitions. [2022-12-06 17:15:31,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 1178 transitions, 33430 flow [2022-12-06 17:15:31,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:15:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:15:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2022-12-06 17:15:31,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9250535331905781 [2022-12-06 17:15:31,274 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 348 predicate places. [2022-12-06 17:15:31,274 INFO L495 AbstractCegarLoop]: Abstraction has has 763 places, 1178 transitions, 33430 flow [2022-12-06 17:15:31,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:31,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:31,275 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:31,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 17:15:31,275 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1023285807, now seen corresponding path program 2 times [2022-12-06 17:15:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:31,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124562694] [2022-12-06 17:15:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:31,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124562694] [2022-12-06 17:15:31,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124562694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:31,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:31,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:15:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484123517] [2022-12-06 17:15:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:31,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:15:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:15:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:15:31,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2022-12-06 17:15:31,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 1178 transitions, 33430 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:31,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:31,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2022-12-06 17:15:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:32,978 INFO L130 PetriNetUnfolder]: 935/5863 cut-off events. [2022-12-06 17:15:32,979 INFO L131 PetriNetUnfolder]: For 303588/357995 co-relation queries the response was YES. [2022-12-06 17:15:33,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43103 conditions, 5863 events. 935/5863 cut-off events. For 303588/357995 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 57063 event pairs, 297 based on Foata normal form. 53/5366 useless extension candidates. Maximal degree in co-relation 35744. Up to 1489 conditions per place. [2022-12-06 17:15:33,025 INFO L137 encePairwiseOnDemand]: 463/467 looper letters, 92 selfloop transitions, 2 changer transitions 449/1138 dead transitions. [2022-12-06 17:15:33,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 1138 transitions, 32207 flow [2022-12-06 17:15:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:15:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:15:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-12-06 17:15:33,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9243397573162027 [2022-12-06 17:15:33,027 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 350 predicate places. [2022-12-06 17:15:33,027 INFO L495 AbstractCegarLoop]: Abstraction has has 765 places, 1138 transitions, 32207 flow [2022-12-06 17:15:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:33,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:33,028 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:33,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 17:15:33,028 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 704236237, now seen corresponding path program 1 times [2022-12-06 17:15:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:33,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568233853] [2022-12-06 17:15:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568233853] [2022-12-06 17:15:33,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568233853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:33,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:33,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:15:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489222860] [2022-12-06 17:15:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:33,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:15:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:15:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:15:33,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2022-12-06 17:15:33,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 1138 transitions, 32207 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:33,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:33,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2022-12-06 17:15:33,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:34,594 INFO L130 PetriNetUnfolder]: 932/5818 cut-off events. [2022-12-06 17:15:34,594 INFO L131 PetriNetUnfolder]: For 304808/357438 co-relation queries the response was YES. [2022-12-06 17:15:34,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43475 conditions, 5818 events. 932/5818 cut-off events. For 304808/357438 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 56688 event pairs, 296 based on Foata normal form. 45/5320 useless extension candidates. Maximal degree in co-relation 36025. Up to 1485 conditions per place. [2022-12-06 17:15:34,652 INFO L137 encePairwiseOnDemand]: 463/467 looper letters, 86 selfloop transitions, 3 changer transitions 452/1136 dead transitions. [2022-12-06 17:15:34,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 1136 transitions, 32551 flow [2022-12-06 17:15:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:15:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:15:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2022-12-06 17:15:34,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9250535331905781 [2022-12-06 17:15:34,654 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 352 predicate places. [2022-12-06 17:15:34,654 INFO L495 AbstractCegarLoop]: Abstraction has has 767 places, 1136 transitions, 32551 flow [2022-12-06 17:15:34,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:34,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:34,654 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:34,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 17:15:34,655 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1028703763, now seen corresponding path program 2 times [2022-12-06 17:15:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:34,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341077309] [2022-12-06 17:15:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341077309] [2022-12-06 17:15:34,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341077309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:34,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:34,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:15:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667282568] [2022-12-06 17:15:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:34,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:15:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:15:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:15:34,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2022-12-06 17:15:34,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 1136 transitions, 32551 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:34,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:34,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2022-12-06 17:15:34,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:36,206 INFO L130 PetriNetUnfolder]: 880/5647 cut-off events. [2022-12-06 17:15:36,207 INFO L131 PetriNetUnfolder]: For 305830/357716 co-relation queries the response was YES. [2022-12-06 17:15:36,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41609 conditions, 5647 events. 880/5647 cut-off events. For 305830/357716 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 54573 event pairs, 287 based on Foata normal form. 40/5154 useless extension candidates. Maximal degree in co-relation 34101. Up to 1405 conditions per place. [2022-12-06 17:15:36,253 INFO L137 encePairwiseOnDemand]: 460/467 looper letters, 91 selfloop transitions, 6 changer transitions 454/1116 dead transitions. [2022-12-06 17:15:36,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 1116 transitions, 32074 flow [2022-12-06 17:15:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:15:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:15:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2022-12-06 17:15:36,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9250535331905781 [2022-12-06 17:15:36,255 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 354 predicate places. [2022-12-06 17:15:36,255 INFO L495 AbstractCegarLoop]: Abstraction has has 769 places, 1116 transitions, 32074 flow [2022-12-06 17:15:36,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:36,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:36,256 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:36,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 17:15:36,257 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -445067025, now seen corresponding path program 1 times [2022-12-06 17:15:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:36,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106941594] [2022-12-06 17:15:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:36,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106941594] [2022-12-06 17:15:36,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106941594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:36,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:36,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868179582] [2022-12-06 17:15:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:36,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:36,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:36,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:15:36,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 1116 transitions, 32074 flow. Second operand has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:36,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:36,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:15:36,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:38,341 INFO L130 PetriNetUnfolder]: 1265/7894 cut-off events. [2022-12-06 17:15:38,341 INFO L131 PetriNetUnfolder]: For 359396/394432 co-relation queries the response was YES. [2022-12-06 17:15:38,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51617 conditions, 7894 events. 1265/7894 cut-off events. For 359396/394432 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 82581 event pairs, 325 based on Foata normal form. 0/7127 useless extension candidates. Maximal degree in co-relation 34283. Up to 1631 conditions per place. [2022-12-06 17:15:38,416 INFO L137 encePairwiseOnDemand]: 459/467 looper letters, 152 selfloop transitions, 10 changer transitions 462/1149 dead transitions. [2022-12-06 17:15:38,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 1149 transitions, 33437 flow [2022-12-06 17:15:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:15:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:15:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2386 transitions. [2022-12-06 17:15:38,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8515346181299072 [2022-12-06 17:15:38,419 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 359 predicate places. [2022-12-06 17:15:38,419 INFO L495 AbstractCegarLoop]: Abstraction has has 774 places, 1149 transitions, 33437 flow [2022-12-06 17:15:38,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:38,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:38,419 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:38,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 17:15:38,420 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -525821669, now seen corresponding path program 2 times [2022-12-06 17:15:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:38,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148352231] [2022-12-06 17:15:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148352231] [2022-12-06 17:15:38,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148352231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:38,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:38,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788042610] [2022-12-06 17:15:38,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:38,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:38,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:38,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:38,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 467 [2022-12-06 17:15:38,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 1149 transitions, 33437 flow. Second operand has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:38,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:38,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 467 [2022-12-06 17:15:38,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:40,664 INFO L130 PetriNetUnfolder]: 1245/7595 cut-off events. [2022-12-06 17:15:40,664 INFO L131 PetriNetUnfolder]: For 380867/416240 co-relation queries the response was YES. [2022-12-06 17:15:40,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52290 conditions, 7595 events. 1245/7595 cut-off events. For 380867/416240 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 78396 event pairs, 315 based on Foata normal form. 11/6888 useless extension candidates. Maximal degree in co-relation 34654. Up to 1627 conditions per place. [2022-12-06 17:15:40,740 INFO L137 encePairwiseOnDemand]: 443/467 looper letters, 159 selfloop transitions, 23 changer transitions 476/1185 dead transitions. [2022-12-06 17:15:40,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 1185 transitions, 34797 flow [2022-12-06 17:15:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:15:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:15:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2803 transitions. [2022-12-06 17:15:40,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.857448761089018 [2022-12-06 17:15:40,742 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 365 predicate places. [2022-12-06 17:15:40,742 INFO L495 AbstractCegarLoop]: Abstraction has has 780 places, 1185 transitions, 34797 flow [2022-12-06 17:15:40,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:40,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:40,742 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:40,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 17:15:40,743 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1099001881, now seen corresponding path program 3 times [2022-12-06 17:15:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:40,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635909264] [2022-12-06 17:15:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:40,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:40,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635909264] [2022-12-06 17:15:40,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635909264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:40,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:40,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:40,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66922697] [2022-12-06 17:15:40,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:40,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:40,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:40,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 467 [2022-12-06 17:15:40,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 1185 transitions, 34797 flow. Second operand has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:40,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:40,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 467 [2022-12-06 17:15:40,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:43,079 INFO L130 PetriNetUnfolder]: 1234/7342 cut-off events. [2022-12-06 17:15:43,079 INFO L131 PetriNetUnfolder]: For 397982/435505 co-relation queries the response was YES. [2022-12-06 17:15:43,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52854 conditions, 7342 events. 1234/7342 cut-off events. For 397982/435505 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 75006 event pairs, 312 based on Foata normal form. 4/6656 useless extension candidates. Maximal degree in co-relation 42764. Up to 1604 conditions per place. [2022-12-06 17:15:43,146 INFO L137 encePairwiseOnDemand]: 448/467 looper letters, 163 selfloop transitions, 18 changer transitions 480/1188 dead transitions. [2022-12-06 17:15:43,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1188 transitions, 35419 flow [2022-12-06 17:15:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:15:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:15:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2788 transitions. [2022-12-06 17:15:43,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8528602018966045 [2022-12-06 17:15:43,148 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 371 predicate places. [2022-12-06 17:15:43,148 INFO L495 AbstractCegarLoop]: Abstraction has has 786 places, 1188 transitions, 35419 flow [2022-12-06 17:15:43,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:43,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:43,148 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:43,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 17:15:43,149 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash 766693789, now seen corresponding path program 4 times [2022-12-06 17:15:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:43,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075600516] [2022-12-06 17:15:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:43,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075600516] [2022-12-06 17:15:43,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075600516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:43,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:43,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:43,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179416223] [2022-12-06 17:15:43,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:43,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:43,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:43,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:43,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:43,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:15:43,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 1188 transitions, 35419 flow. Second operand has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:43,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:43,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:15:43,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:45,381 INFO L130 PetriNetUnfolder]: 1187/7105 cut-off events. [2022-12-06 17:15:45,382 INFO L131 PetriNetUnfolder]: For 378578/409273 co-relation queries the response was YES. [2022-12-06 17:15:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52064 conditions, 7105 events. 1187/7105 cut-off events. For 378578/409273 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 71868 event pairs, 308 based on Foata normal form. 0/6443 useless extension candidates. Maximal degree in co-relation 42061. Up to 1534 conditions per place. [2022-12-06 17:15:45,453 INFO L137 encePairwiseOnDemand]: 452/467 looper letters, 179 selfloop transitions, 12 changer transitions 499/1193 dead transitions. [2022-12-06 17:15:45,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 792 places, 1193 transitions, 34795 flow [2022-12-06 17:15:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:15:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:15:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2791 transitions. [2022-12-06 17:15:45,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8537779137350872 [2022-12-06 17:15:45,456 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 377 predicate places. [2022-12-06 17:15:45,456 INFO L495 AbstractCegarLoop]: Abstraction has has 792 places, 1193 transitions, 34795 flow [2022-12-06 17:15:45,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:45,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:45,457 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 17:15:45,457 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -811278347, now seen corresponding path program 1 times [2022-12-06 17:15:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154351269] [2022-12-06 17:15:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:45,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154351269] [2022-12-06 17:15:45,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154351269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:45,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:45,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149368805] [2022-12-06 17:15:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:45,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:45,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:45,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:45,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:45,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 467 [2022-12-06 17:15:45,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 1193 transitions, 34795 flow. Second operand has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:45,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:45,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 467 [2022-12-06 17:15:45,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:48,445 INFO L130 PetriNetUnfolder]: 1909/9419 cut-off events. [2022-12-06 17:15:48,445 INFO L131 PetriNetUnfolder]: For 1071412/1125077 co-relation queries the response was YES. [2022-12-06 17:15:48,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78535 conditions, 9419 events. 1909/9419 cut-off events. For 1071412/1125077 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 101792 event pairs, 632 based on Foata normal form. 61/8462 useless extension candidates. Maximal degree in co-relation 67916. Up to 2140 conditions per place. [2022-12-06 17:15:48,520 INFO L137 encePairwiseOnDemand]: 445/467 looper letters, 175 selfloop transitions, 40 changer transitions 536/1282 dead transitions. [2022-12-06 17:15:48,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 1282 transitions, 38624 flow [2022-12-06 17:15:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:15:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:15:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2811 transitions. [2022-12-06 17:15:48,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8598959926583053 [2022-12-06 17:15:48,523 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 383 predicate places. [2022-12-06 17:15:48,523 INFO L495 AbstractCegarLoop]: Abstraction has has 798 places, 1282 transitions, 38624 flow [2022-12-06 17:15:48,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:48,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:48,523 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:48,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 17:15:48,524 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -454224169, now seen corresponding path program 2 times [2022-12-06 17:15:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:48,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515306125] [2022-12-06 17:15:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:48,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515306125] [2022-12-06 17:15:48,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515306125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:48,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:48,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87512056] [2022-12-06 17:15:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:48,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:48,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:48,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 467 [2022-12-06 17:15:48,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 1282 transitions, 38624 flow. Second operand has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:48,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:48,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 467 [2022-12-06 17:15:48,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:51,466 INFO L130 PetriNetUnfolder]: 1854/9064 cut-off events. [2022-12-06 17:15:51,466 INFO L131 PetriNetUnfolder]: For 1268522/1346905 co-relation queries the response was YES. [2022-12-06 17:15:51,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79295 conditions, 9064 events. 1854/9064 cut-off events. For 1268522/1346905 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 97574 event pairs, 317 based on Foata normal form. 126/8264 useless extension candidates. Maximal degree in co-relation 68381. Up to 2127 conditions per place. [2022-12-06 17:15:51,548 INFO L137 encePairwiseOnDemand]: 456/467 looper letters, 224 selfloop transitions, 24 changer transitions 551/1330 dead transitions. [2022-12-06 17:15:51,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 1330 transitions, 41453 flow [2022-12-06 17:15:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:15:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:15:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2407 transitions. [2022-12-06 17:15:51,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8590292648108494 [2022-12-06 17:15:51,550 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 388 predicate places. [2022-12-06 17:15:51,550 INFO L495 AbstractCegarLoop]: Abstraction has has 803 places, 1330 transitions, 41453 flow [2022-12-06 17:15:51,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 389.8) internal successors, (1949), 5 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:51,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:51,551 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:51,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 17:15:51,551 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1956132141, now seen corresponding path program 3 times [2022-12-06 17:15:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:51,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750849731] [2022-12-06 17:15:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:51,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:51,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750849731] [2022-12-06 17:15:51,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750849731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:51,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:51,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221591651] [2022-12-06 17:15:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:51,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:51,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:15:51,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 803 places, 1330 transitions, 41453 flow. Second operand has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:51,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:51,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:15:51,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:54,723 INFO L130 PetriNetUnfolder]: 1847/9162 cut-off events. [2022-12-06 17:15:54,723 INFO L131 PetriNetUnfolder]: For 1246541/1329479 co-relation queries the response was YES. [2022-12-06 17:15:54,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82767 conditions, 9162 events. 1847/9162 cut-off events. For 1246541/1329479 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 99141 event pairs, 299 based on Foata normal form. 155/8387 useless extension candidates. Maximal degree in co-relation 71702. Up to 2175 conditions per place. [2022-12-06 17:15:54,806 INFO L137 encePairwiseOnDemand]: 452/467 looper letters, 233 selfloop transitions, 15 changer transitions 587/1364 dead transitions. [2022-12-06 17:15:54,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 1364 transitions, 42713 flow [2022-12-06 17:15:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:15:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:15:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2794 transitions. [2022-12-06 17:15:54,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8546956255735699 [2022-12-06 17:15:54,809 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 394 predicate places. [2022-12-06 17:15:54,809 INFO L495 AbstractCegarLoop]: Abstraction has has 809 places, 1364 transitions, 42713 flow [2022-12-06 17:15:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:54,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:54,809 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 17:15:54,810 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash -131625513, now seen corresponding path program 4 times [2022-12-06 17:15:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:54,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031783207] [2022-12-06 17:15:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:54,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:54,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031783207] [2022-12-06 17:15:54,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031783207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:54,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:54,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768789525] [2022-12-06 17:15:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:54,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:15:54,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 1364 transitions, 42713 flow. Second operand has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:54,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:54,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:15:54,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:15:57,819 INFO L130 PetriNetUnfolder]: 1747/8696 cut-off events. [2022-12-06 17:15:57,819 INFO L131 PetriNetUnfolder]: For 1124681/1203772 co-relation queries the response was YES. [2022-12-06 17:15:57,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80376 conditions, 8696 events. 1747/8696 cut-off events. For 1124681/1203772 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 92666 event pairs, 306 based on Foata normal form. 299/8120 useless extension candidates. Maximal degree in co-relation 69458. Up to 2035 conditions per place. [2022-12-06 17:15:57,900 INFO L137 encePairwiseOnDemand]: 450/467 looper letters, 224 selfloop transitions, 38 changer transitions 592/1361 dead transitions. [2022-12-06 17:15:57,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 815 places, 1361 transitions, 43337 flow [2022-12-06 17:15:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:15:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:15:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2783 transitions. [2022-12-06 17:15:57,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8513306821658 [2022-12-06 17:15:57,902 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 400 predicate places. [2022-12-06 17:15:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 815 places, 1361 transitions, 43337 flow [2022-12-06 17:15:57,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.2) internal successors, (1941), 5 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:57,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:15:57,903 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:15:57,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 17:15:57,903 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:15:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:15:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 825630482, now seen corresponding path program 1 times [2022-12-06 17:15:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:15:57,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506467644] [2022-12-06 17:15:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:15:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:15:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:15:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:15:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:15:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506467644] [2022-12-06 17:15:58,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506467644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:15:58,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:15:58,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:15:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265906081] [2022-12-06 17:15:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:15:58,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:15:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:15:58,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:15:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:15:58,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:15:58,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 1361 transitions, 43337 flow. Second operand has 5 states, 5 states have (on average 388.4) internal successors, (1942), 5 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:15:58,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:15:58,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:15:58,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:00,745 INFO L130 PetriNetUnfolder]: 1747/8701 cut-off events. [2022-12-06 17:16:00,745 INFO L131 PetriNetUnfolder]: For 1185150/1257067 co-relation queries the response was YES. [2022-12-06 17:16:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82233 conditions, 8701 events. 1747/8701 cut-off events. For 1185150/1257067 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 92802 event pairs, 306 based on Foata normal form. 101/7928 useless extension candidates. Maximal degree in co-relation 71108. Up to 2038 conditions per place. [2022-12-06 17:16:00,834 INFO L137 encePairwiseOnDemand]: 450/467 looper letters, 209 selfloop transitions, 31 changer transitions 594/1362 dead transitions. [2022-12-06 17:16:00,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 1362 transitions, 44225 flow [2022-12-06 17:16:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:16:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:16:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2778 transitions. [2022-12-06 17:16:00,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8498011624349954 [2022-12-06 17:16:00,837 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 406 predicate places. [2022-12-06 17:16:00,837 INFO L495 AbstractCegarLoop]: Abstraction has has 821 places, 1362 transitions, 44225 flow [2022-12-06 17:16:00,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.4) internal successors, (1942), 5 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:00,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:00,838 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:00,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 17:16:00,838 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -725587208, now seen corresponding path program 2 times [2022-12-06 17:16:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708350463] [2022-12-06 17:16:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:00,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:00,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708350463] [2022-12-06 17:16:00,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708350463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:00,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:00,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:16:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909285696] [2022-12-06 17:16:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:00,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:16:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:16:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:16:00,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:16:00,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 1362 transitions, 44225 flow. Second operand has 5 states, 5 states have (on average 388.4) internal successors, (1942), 5 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:00,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:00,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:16:00,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:03,591 INFO L130 PetriNetUnfolder]: 1702/8593 cut-off events. [2022-12-06 17:16:03,592 INFO L131 PetriNetUnfolder]: For 1201150/1271314 co-relation queries the response was YES. [2022-12-06 17:16:03,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81913 conditions, 8593 events. 1702/8593 cut-off events. For 1201150/1271314 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 91731 event pairs, 304 based on Foata normal form. 96/7784 useless extension candidates. Maximal degree in co-relation 50715. Up to 1957 conditions per place. [2022-12-06 17:16:03,668 INFO L137 encePairwiseOnDemand]: 452/467 looper letters, 179 selfloop transitions, 22 changer transitions 598/1293 dead transitions. [2022-12-06 17:16:03,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 1293 transitions, 42267 flow [2022-12-06 17:16:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:16:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:16:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2767 transitions. [2022-12-06 17:16:03,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8464362190272254 [2022-12-06 17:16:03,670 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 412 predicate places. [2022-12-06 17:16:03,670 INFO L495 AbstractCegarLoop]: Abstraction has has 827 places, 1293 transitions, 42267 flow [2022-12-06 17:16:03,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.4) internal successors, (1942), 5 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:03,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:03,671 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:03,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 17:16:03,671 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 295510644, now seen corresponding path program 1 times [2022-12-06 17:16:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:03,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530277931] [2022-12-06 17:16:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:03,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530277931] [2022-12-06 17:16:03,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530277931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:03,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:03,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:16:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671753514] [2022-12-06 17:16:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:03,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:16:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:16:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:16:03,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 467 [2022-12-06 17:16:03,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 1293 transitions, 42267 flow. Second operand has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:03,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:03,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 467 [2022-12-06 17:16:03,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:06,673 INFO L130 PetriNetUnfolder]: 1553/7622 cut-off events. [2022-12-06 17:16:06,673 INFO L131 PetriNetUnfolder]: For 1215045/1287031 co-relation queries the response was YES. [2022-12-06 17:16:06,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73983 conditions, 7622 events. 1553/7622 cut-off events. For 1215045/1287031 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 78732 event pairs, 284 based on Foata normal form. 184/7037 useless extension candidates. Maximal degree in co-relation 63112. Up to 1670 conditions per place. [2022-12-06 17:16:06,763 INFO L137 encePairwiseOnDemand]: 456/467 looper letters, 191 selfloop transitions, 21 changer transitions 596/1259 dead transitions. [2022-12-06 17:16:06,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 832 places, 1259 transitions, 42351 flow [2022-12-06 17:16:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:16:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:16:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2407 transitions. [2022-12-06 17:16:06,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8590292648108494 [2022-12-06 17:16:06,765 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 417 predicate places. [2022-12-06 17:16:06,765 INFO L495 AbstractCegarLoop]: Abstraction has has 832 places, 1259 transitions, 42351 flow [2022-12-06 17:16:06,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:06,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:06,766 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:06,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 17:16:06,766 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash -694768316, now seen corresponding path program 2 times [2022-12-06 17:16:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:06,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124223605] [2022-12-06 17:16:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:06,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:06,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124223605] [2022-12-06 17:16:06,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124223605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:06,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:06,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:16:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509948606] [2022-12-06 17:16:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:06,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:16:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:16:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:16:06,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 467 [2022-12-06 17:16:06,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 832 places, 1259 transitions, 42351 flow. Second operand has 5 states, 5 states have (on average 388.4) internal successors, (1942), 5 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:06,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:06,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 467 [2022-12-06 17:16:06,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:09,277 INFO L130 PetriNetUnfolder]: 1441/7125 cut-off events. [2022-12-06 17:16:09,277 INFO L131 PetriNetUnfolder]: For 997390/1059893 co-relation queries the response was YES. [2022-12-06 17:16:09,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70445 conditions, 7125 events. 1441/7125 cut-off events. For 997390/1059893 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 71844 event pairs, 284 based on Foata normal form. 219/6622 useless extension candidates. Maximal degree in co-relation 59735. Up to 1526 conditions per place. [2022-12-06 17:16:09,353 INFO L137 encePairwiseOnDemand]: 452/467 looper letters, 159 selfloop transitions, 22 changer transitions 599/1195 dead transitions. [2022-12-06 17:16:09,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 838 places, 1195 transitions, 40754 flow [2022-12-06 17:16:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:16:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:16:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2769 transitions. [2022-12-06 17:16:09,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8470480269195473 [2022-12-06 17:16:09,355 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 423 predicate places. [2022-12-06 17:16:09,355 INFO L495 AbstractCegarLoop]: Abstraction has has 838 places, 1195 transitions, 40754 flow [2022-12-06 17:16:09,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 388.4) internal successors, (1942), 5 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:09,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:09,356 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:09,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 17:16:09,356 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 33997636, now seen corresponding path program 1 times [2022-12-06 17:16:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:09,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575308036] [2022-12-06 17:16:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575308036] [2022-12-06 17:16:10,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575308036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:10,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:10,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:16:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399784695] [2022-12-06 17:16:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:10,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:16:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:16:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:16:10,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:16:10,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 838 places, 1195 transitions, 40754 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:10,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:10,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:16:10,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:18,052 INFO L130 PetriNetUnfolder]: 3351/12179 cut-off events. [2022-12-06 17:16:18,052 INFO L131 PetriNetUnfolder]: For 857983/882079 co-relation queries the response was YES. [2022-12-06 17:16:18,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111328 conditions, 12179 events. 3351/12179 cut-off events. For 857983/882079 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 126603 event pairs, 1331 based on Foata normal form. 11/11010 useless extension candidates. Maximal degree in co-relation 79238. Up to 4213 conditions per place. [2022-12-06 17:16:18,162 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 471 selfloop transitions, 11 changer transitions 715/1653 dead transitions. [2022-12-06 17:16:18,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 898 places, 1653 transitions, 52264 flow [2022-12-06 17:16:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-06 17:16:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-12-06 17:16:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 21304 transitions. [2022-12-06 17:16:18,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.747849896443992 [2022-12-06 17:16:18,172 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 483 predicate places. [2022-12-06 17:16:18,172 INFO L495 AbstractCegarLoop]: Abstraction has has 898 places, 1653 transitions, 52264 flow [2022-12-06 17:16:18,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:18,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:18,173 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:18,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 17:16:18,173 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1685698704, now seen corresponding path program 2 times [2022-12-06 17:16:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:18,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064805914] [2022-12-06 17:16:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:18,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064805914] [2022-12-06 17:16:18,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064805914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:18,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:18,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:16:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94914115] [2022-12-06 17:16:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:18,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:16:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:16:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:16:18,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:16:18,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 1653 transitions, 52264 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:18,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:18,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:16:18,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:27,353 INFO L130 PetriNetUnfolder]: 3382/12250 cut-off events. [2022-12-06 17:16:27,353 INFO L131 PetriNetUnfolder]: For 891718/917366 co-relation queries the response was YES. [2022-12-06 17:16:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119805 conditions, 12250 events. 3382/12250 cut-off events. For 891718/917366 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 127657 event pairs, 872 based on Foata normal form. 8/11133 useless extension candidates. Maximal degree in co-relation 86547. Up to 4213 conditions per place. [2022-12-06 17:16:27,547 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 721 selfloop transitions, 128 changer transitions 830/2131 dead transitions. [2022-12-06 17:16:27,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 2131 transitions, 67261 flow [2022-12-06 17:16:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-06 17:16:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-12-06 17:16:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 21296 transitions. [2022-12-06 17:16:27,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7475690665917787 [2022-12-06 17:16:27,556 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 543 predicate places. [2022-12-06 17:16:27,556 INFO L495 AbstractCegarLoop]: Abstraction has has 958 places, 2131 transitions, 67261 flow [2022-12-06 17:16:27,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:27,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:27,557 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:27,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 17:16:27,558 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1403037464, now seen corresponding path program 3 times [2022-12-06 17:16:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:27,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599253466] [2022-12-06 17:16:27,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:27,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:28,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599253466] [2022-12-06 17:16:28,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599253466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:28,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:28,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:16:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396822873] [2022-12-06 17:16:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:28,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:16:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:16:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:16:28,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:16:28,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 2131 transitions, 67261 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:28,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:28,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:16:28,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:37,778 INFO L130 PetriNetUnfolder]: 3565/12974 cut-off events. [2022-12-06 17:16:37,778 INFO L131 PetriNetUnfolder]: For 995208/1029076 co-relation queries the response was YES. [2022-12-06 17:16:37,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131765 conditions, 12974 events. 3565/12974 cut-off events. For 995208/1029076 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 134704 event pairs, 903 based on Foata normal form. 345/12200 useless extension candidates. Maximal degree in co-relation 118204. Up to 4156 conditions per place. [2022-12-06 17:16:38,028 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 810 selfloop transitions, 157 changer transitions 943/2362 dead transitions. [2022-12-06 17:16:38,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 2362 transitions, 78200 flow [2022-12-06 17:16:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-06 17:16:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-06 17:16:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 20571 transitions. [2022-12-06 17:16:38,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7465974667005407 [2022-12-06 17:16:38,036 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 601 predicate places. [2022-12-06 17:16:38,037 INFO L495 AbstractCegarLoop]: Abstraction has has 1016 places, 2362 transitions, 78200 flow [2022-12-06 17:16:38,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:38,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:38,037 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 17:16:38,038 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash 122903412, now seen corresponding path program 4 times [2022-12-06 17:16:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:38,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635135051] [2022-12-06 17:16:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635135051] [2022-12-06 17:16:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635135051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:38,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:38,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:16:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895663830] [2022-12-06 17:16:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:38,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:16:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:16:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:16:38,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:16:38,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 2362 transitions, 78200 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:38,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:38,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:16:38,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:16:49,153 INFO L130 PetriNetUnfolder]: 3570/12821 cut-off events. [2022-12-06 17:16:49,153 INFO L131 PetriNetUnfolder]: For 1046126/1080287 co-relation queries the response was YES. [2022-12-06 17:16:49,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141210 conditions, 12821 events. 3570/12821 cut-off events. For 1046126/1080287 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 134085 event pairs, 886 based on Foata normal form. 352/12017 useless extension candidates. Maximal degree in co-relation 101835. Up to 4213 conditions per place. [2022-12-06 17:16:49,288 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 804 selfloop transitions, 154 changer transitions 1038/2448 dead transitions. [2022-12-06 17:16:49,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1071 places, 2448 transitions, 85087 flow [2022-12-06 17:16:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-06 17:16:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-06 17:16:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 19533 transitions. [2022-12-06 17:16:49,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7469027225451208 [2022-12-06 17:16:49,296 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 656 predicate places. [2022-12-06 17:16:49,296 INFO L495 AbstractCegarLoop]: Abstraction has has 1071 places, 2448 transitions, 85087 flow [2022-12-06 17:16:49,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:49,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:16:49,297 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:16:49,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 17:16:49,297 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:16:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:16:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1467153736, now seen corresponding path program 5 times [2022-12-06 17:16:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:16:49,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365210678] [2022-12-06 17:16:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:16:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:16:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:16:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:16:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:16:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365210678] [2022-12-06 17:16:50,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365210678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:16:50,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:16:50,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:16:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656760906] [2022-12-06 17:16:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:16:50,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:16:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:16:50,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:16:50,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:16:50,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:16:50,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1071 places, 2448 transitions, 85087 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:16:50,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:16:50,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:16:50,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:17:00,979 INFO L130 PetriNetUnfolder]: 3647/13212 cut-off events. [2022-12-06 17:17:00,979 INFO L131 PetriNetUnfolder]: For 1112947/1151950 co-relation queries the response was YES. [2022-12-06 17:17:01,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148910 conditions, 13212 events. 3647/13212 cut-off events. For 1112947/1151950 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 137285 event pairs, 902 based on Foata normal form. 355/12441 useless extension candidates. Maximal degree in co-relation 134267. Up to 4156 conditions per place. [2022-12-06 17:17:01,122 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 790 selfloop transitions, 151 changer transitions 1124/2517 dead transitions. [2022-12-06 17:17:01,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1123 places, 2517 transitions, 91780 flow [2022-12-06 17:17:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 17:17:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 17:17:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 18495 transitions. [2022-12-06 17:17:01,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.747242535655125 [2022-12-06 17:17:01,130 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 708 predicate places. [2022-12-06 17:17:01,130 INFO L495 AbstractCegarLoop]: Abstraction has has 1123 places, 2517 transitions, 91780 flow [2022-12-06 17:17:01,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:01,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:17:01,131 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:17:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 17:17:01,131 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:17:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:17:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash -462591680, now seen corresponding path program 6 times [2022-12-06 17:17:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:17:01,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147283969] [2022-12-06 17:17:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:17:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:17:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:17:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:17:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:17:01,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147283969] [2022-12-06 17:17:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147283969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:17:01,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:17:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:17:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948416687] [2022-12-06 17:17:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:17:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:17:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:17:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:17:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:17:01,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:17:02,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1123 places, 2517 transitions, 91780 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:02,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:17:02,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:17:02,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:17:12,005 INFO L130 PetriNetUnfolder]: 3648/13101 cut-off events. [2022-12-06 17:17:12,006 INFO L131 PetriNetUnfolder]: For 1168355/1213363 co-relation queries the response was YES. [2022-12-06 17:17:12,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158838 conditions, 13101 events. 3648/13101 cut-off events. For 1168355/1213363 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 137366 event pairs, 900 based on Foata normal form. 353/12298 useless extension candidates. Maximal degree in co-relation 115563. Up to 4213 conditions per place. [2022-12-06 17:17:12,147 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 808 selfloop transitions, 172 changer transitions 1186/2618 dead transitions. [2022-12-06 17:17:12,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1168 places, 2618 transitions, 100353 flow [2022-12-06 17:17:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 17:17:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 17:17:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 16077 transitions. [2022-12-06 17:17:12,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7483940042826552 [2022-12-06 17:17:12,154 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 753 predicate places. [2022-12-06 17:17:12,154 INFO L495 AbstractCegarLoop]: Abstraction has has 1168 places, 2618 transitions, 100353 flow [2022-12-06 17:17:12,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:12,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:17:12,155 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:17:12,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 17:17:12,155 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:17:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:17:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -352283384, now seen corresponding path program 7 times [2022-12-06 17:17:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:17:12,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931330951] [2022-12-06 17:17:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:17:12,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:17:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:17:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:17:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:17:12,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931330951] [2022-12-06 17:17:12,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931330951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:17:12,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:17:12,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:17:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260162466] [2022-12-06 17:17:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:17:12,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:17:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:17:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:17:12,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:17:12,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:17:12,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1168 places, 2618 transitions, 100353 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:12,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:17:12,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:17:12,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:17:23,222 INFO L130 PetriNetUnfolder]: 3713/13456 cut-off events. [2022-12-06 17:17:23,222 INFO L131 PetriNetUnfolder]: For 1241218/1290474 co-relation queries the response was YES. [2022-12-06 17:17:23,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166383 conditions, 13456 events. 3713/13456 cut-off events. For 1241218/1290474 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 140259 event pairs, 892 based on Foata normal form. 353/12682 useless extension candidates. Maximal degree in co-relation 150618. Up to 4156 conditions per place. [2022-12-06 17:17:23,360 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 804 selfloop transitions, 183 changer transitions 1228/2667 dead transitions. [2022-12-06 17:17:23,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 2667 transitions, 106964 flow [2022-12-06 17:17:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 17:17:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 17:17:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 11959 transitions. [2022-12-06 17:17:23,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7531805013225847 [2022-12-06 17:17:23,368 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 786 predicate places. [2022-12-06 17:17:23,368 INFO L495 AbstractCegarLoop]: Abstraction has has 1201 places, 2667 transitions, 106964 flow [2022-12-06 17:17:23,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:23,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:17:23,370 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:17:23,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 17:17:23,370 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:17:23,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:17:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2118111936, now seen corresponding path program 8 times [2022-12-06 17:17:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:17:23,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094709877] [2022-12-06 17:17:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:17:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:17:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:17:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:17:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:17:24,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094709877] [2022-12-06 17:17:24,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094709877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:17:24,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:17:24,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:17:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146568386] [2022-12-06 17:17:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:17:24,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:17:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:17:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:17:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:17:24,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:17:24,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1201 places, 2667 transitions, 106964 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:24,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:17:24,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:17:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:17:34,169 INFO L130 PetriNetUnfolder]: 3674/13240 cut-off events. [2022-12-06 17:17:34,170 INFO L131 PetriNetUnfolder]: For 1285899/1341504 co-relation queries the response was YES. [2022-12-06 17:17:34,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174709 conditions, 13240 events. 3674/13240 cut-off events. For 1285899/1341504 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 138978 event pairs, 891 based on Foata normal form. 342/12426 useless extension candidates. Maximal degree in co-relation 128336. Up to 4213 conditions per place. [2022-12-06 17:17:34,321 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 797 selfloop transitions, 173 changer transitions 1270/2692 dead transitions. [2022-12-06 17:17:34,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1231 places, 2692 transitions, 112412 flow [2022-12-06 17:17:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 17:17:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 17:17:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 10932 transitions. [2022-12-06 17:17:34,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7551288250328106 [2022-12-06 17:17:34,327 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 816 predicate places. [2022-12-06 17:17:34,328 INFO L495 AbstractCegarLoop]: Abstraction has has 1231 places, 2692 transitions, 112412 flow [2022-12-06 17:17:34,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:34,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:17:34,329 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:17:34,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 17:17:34,329 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:17:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:17:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash -69983256, now seen corresponding path program 9 times [2022-12-06 17:17:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:17:34,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125753099] [2022-12-06 17:17:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:17:34,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:17:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:17:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:17:35,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:17:35,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125753099] [2022-12-06 17:17:35,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125753099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:17:35,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:17:35,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:17:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325506940] [2022-12-06 17:17:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:17:35,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:17:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:17:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:17:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:17:35,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:17:35,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1231 places, 2692 transitions, 112412 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:35,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:17:35,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:17:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:17:46,508 INFO L130 PetriNetUnfolder]: 3673/13257 cut-off events. [2022-12-06 17:17:46,508 INFO L131 PetriNetUnfolder]: For 1352591/1413896 co-relation queries the response was YES. [2022-12-06 17:17:46,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181767 conditions, 13257 events. 3673/13257 cut-off events. For 1352591/1413896 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 139304 event pairs, 890 based on Foata normal form. 355/12454 useless extension candidates. Maximal degree in co-relation 134064. Up to 4213 conditions per place. [2022-12-06 17:17:46,731 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 778 selfloop transitions, 148 changer transitions 1323/2701 dead transitions. [2022-12-06 17:17:46,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1270 places, 2701 transitions, 117262 flow [2022-12-06 17:17:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 17:17:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 17:17:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 14016 transitions. [2022-12-06 17:17:46,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.750321199143469 [2022-12-06 17:17:46,741 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 855 predicate places. [2022-12-06 17:17:46,742 INFO L495 AbstractCegarLoop]: Abstraction has has 1270 places, 2701 transitions, 117262 flow [2022-12-06 17:17:46,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:46,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:17:46,744 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:17:46,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 17:17:46,744 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:17:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:17:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2035643890, now seen corresponding path program 10 times [2022-12-06 17:17:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:17:46,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075771763] [2022-12-06 17:17:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:17:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:17:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:17:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:17:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:17:47,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075771763] [2022-12-06 17:17:47,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075771763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:17:47,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:17:47,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:17:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212184733] [2022-12-06 17:17:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:17:47,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:17:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:17:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:17:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:17:47,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:17:47,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1270 places, 2701 transitions, 117262 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:47,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:17:47,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:17:47,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:17:59,117 INFO L130 PetriNetUnfolder]: 3719/13558 cut-off events. [2022-12-06 17:17:59,117 INFO L131 PetriNetUnfolder]: For 1418313/1482417 co-relation queries the response was YES. [2022-12-06 17:17:59,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187875 conditions, 13558 events. 3719/13558 cut-off events. For 1418313/1482417 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 141911 event pairs, 894 based on Foata normal form. 350/12780 useless extension candidates. Maximal degree in co-relation 170565. Up to 4156 conditions per place. [2022-12-06 17:17:59,270 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 732 selfloop transitions, 116 changer transitions 1400/2700 dead transitions. [2022-12-06 17:17:59,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1319 places, 2700 transitions, 121490 flow [2022-12-06 17:17:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 17:17:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 17:17:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 17456 transitions. [2022-12-06 17:17:59,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7475802997858673 [2022-12-06 17:17:59,278 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 904 predicate places. [2022-12-06 17:17:59,278 INFO L495 AbstractCegarLoop]: Abstraction has has 1319 places, 2700 transitions, 121490 flow [2022-12-06 17:17:59,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:17:59,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:17:59,279 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:17:59,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 17:17:59,279 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:17:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:17:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash 24240964, now seen corresponding path program 11 times [2022-12-06 17:17:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:17:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528649021] [2022-12-06 17:17:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:17:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:17:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:18:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:18:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:18:00,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528649021] [2022-12-06 17:18:00,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528649021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:18:00,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:18:00,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:18:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677284557] [2022-12-06 17:18:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:18:00,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:18:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:18:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:18:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:18:00,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:18:00,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1319 places, 2700 transitions, 121490 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:00,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:18:00,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:18:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:18:12,680 INFO L130 PetriNetUnfolder]: 3871/13969 cut-off events. [2022-12-06 17:18:12,680 INFO L131 PetriNetUnfolder]: For 1534968/1604754 co-relation queries the response was YES. [2022-12-06 17:18:12,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204057 conditions, 13969 events. 3871/13969 cut-off events. For 1534968/1604754 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 146511 event pairs, 897 based on Foata normal form. 309/13128 useless extension candidates. Maximal degree in co-relation 185928. Up to 4156 conditions per place. [2022-12-06 17:18:12,847 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 848 selfloop transitions, 144 changer transitions 1513/2957 dead transitions. [2022-12-06 17:18:12,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1377 places, 2957 transitions, 138511 flow [2022-12-06 17:18:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-06 17:18:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-06 17:18:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 20558 transitions. [2022-12-06 17:18:12,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7461256487496825 [2022-12-06 17:18:12,855 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 962 predicate places. [2022-12-06 17:18:12,855 INFO L495 AbstractCegarLoop]: Abstraction has has 1377 places, 2957 transitions, 138511 flow [2022-12-06 17:18:12,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:12,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:18:12,856 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:18:12,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 17:18:12,856 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:18:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:18:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2103435128, now seen corresponding path program 12 times [2022-12-06 17:18:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:18:12,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221417068] [2022-12-06 17:18:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:18:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:18:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:18:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:18:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:18:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221417068] [2022-12-06 17:18:13,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221417068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:18:13,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:18:13,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:18:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225139695] [2022-12-06 17:18:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:18:13,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:18:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:18:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:18:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:18:13,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:18:13,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1377 places, 2957 transitions, 138511 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:13,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:18:13,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:18:13,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:18:27,657 INFO L130 PetriNetUnfolder]: 3989/14349 cut-off events. [2022-12-06 17:18:27,657 INFO L131 PetriNetUnfolder]: For 1657856/1733340 co-relation queries the response was YES. [2022-12-06 17:18:27,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219292 conditions, 14349 events. 3989/14349 cut-off events. For 1657856/1733340 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 151307 event pairs, 910 based on Foata normal form. 336/13508 useless extension candidates. Maximal degree in co-relation 200322. Up to 4156 conditions per place. [2022-12-06 17:18:27,828 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 927 selfloop transitions, 171 changer transitions 1610/3160 dead transitions. [2022-12-06 17:18:27,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1432 places, 3160 transitions, 154194 flow [2022-12-06 17:18:27,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-06 17:18:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-06 17:18:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 19533 transitions. [2022-12-06 17:18:27,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7469027225451208 [2022-12-06 17:18:27,836 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1017 predicate places. [2022-12-06 17:18:27,836 INFO L495 AbstractCegarLoop]: Abstraction has has 1432 places, 3160 transitions, 154194 flow [2022-12-06 17:18:27,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:27,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:18:27,837 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:18:27,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 17:18:27,837 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:18:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:18:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1031799444, now seen corresponding path program 13 times [2022-12-06 17:18:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:18:27,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829450150] [2022-12-06 17:18:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:18:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:18:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:18:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:18:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:18:28,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829450150] [2022-12-06 17:18:28,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829450150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:18:28,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:18:28,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:18:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587780615] [2022-12-06 17:18:28,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:18:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:18:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:18:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:18:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:18:28,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:18:28,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1432 places, 3160 transitions, 154194 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:28,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:18:28,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:18:28,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:18:42,819 INFO L130 PetriNetUnfolder]: 4020/14470 cut-off events. [2022-12-06 17:18:42,819 INFO L131 PetriNetUnfolder]: For 1743368/1824077 co-relation queries the response was YES. [2022-12-06 17:18:42,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229048 conditions, 14470 events. 4020/14470 cut-off events. For 1743368/1824077 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 153482 event pairs, 899 based on Foata normal form. 323/13621 useless extension candidates. Maximal degree in co-relation 209446. Up to 4156 conditions per place. [2022-12-06 17:18:42,995 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 913 selfloop transitions, 168 changer transitions 1696/3229 dead transitions. [2022-12-06 17:18:42,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1484 places, 3229 transitions, 163415 flow [2022-12-06 17:18:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 17:18:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 17:18:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 18495 transitions. [2022-12-06 17:18:43,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.747242535655125 [2022-12-06 17:18:43,002 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1069 predicate places. [2022-12-06 17:18:43,002 INFO L495 AbstractCegarLoop]: Abstraction has has 1484 places, 3229 transitions, 163415 flow [2022-12-06 17:18:43,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:43,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:18:43,003 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:18:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 17:18:43,003 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:18:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:18:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1941501052, now seen corresponding path program 14 times [2022-12-06 17:18:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:18:43,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010451012] [2022-12-06 17:18:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:18:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:18:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:18:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:18:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:18:43,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010451012] [2022-12-06 17:18:43,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010451012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:18:43,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:18:43,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:18:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576462488] [2022-12-06 17:18:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:18:43,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:18:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:18:43,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:18:43,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:18:43,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:18:43,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1484 places, 3229 transitions, 163415 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:43,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:18:43,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:18:43,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:18:58,824 INFO L130 PetriNetUnfolder]: 4001/14251 cut-off events. [2022-12-06 17:18:58,824 INFO L131 PetriNetUnfolder]: For 1806653/1896716 co-relation queries the response was YES. [2022-12-06 17:18:58,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239852 conditions, 14251 events. 4001/14251 cut-off events. For 1806653/1896716 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 151915 event pairs, 912 based on Foata normal form. 333/13378 useless extension candidates. Maximal degree in co-relation 177583. Up to 4213 conditions per place. [2022-12-06 17:18:58,993 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 907 selfloop transitions, 165 changer transitions 1766/3290 dead transitions. [2022-12-06 17:18:58,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1533 places, 3290 transitions, 172523 flow [2022-12-06 17:18:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 17:18:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 17:18:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 17457 transitions. [2022-12-06 17:18:59,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7476231263383297 [2022-12-06 17:18:59,000 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1118 predicate places. [2022-12-06 17:18:59,000 INFO L495 AbstractCegarLoop]: Abstraction has has 1533 places, 3290 transitions, 172523 flow [2022-12-06 17:18:59,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:59,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:18:59,001 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:18:59,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 17:18:59,001 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:18:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:18:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash 784076320, now seen corresponding path program 15 times [2022-12-06 17:18:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:18:59,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443179030] [2022-12-06 17:18:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:18:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:18:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:18:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:18:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:18:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443179030] [2022-12-06 17:18:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443179030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:18:59,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:18:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:18:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185144852] [2022-12-06 17:18:59,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:18:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:18:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:18:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:18:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:18:59,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:18:59,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1533 places, 3290 transitions, 172523 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:18:59,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:18:59,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:18:59,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:19:14,475 INFO L130 PetriNetUnfolder]: 4020/14352 cut-off events. [2022-12-06 17:19:14,475 INFO L131 PetriNetUnfolder]: For 1891627/1986995 co-relation queries the response was YES. [2022-12-06 17:19:14,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249307 conditions, 14352 events. 4020/14352 cut-off events. For 1891627/1986995 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 153244 event pairs, 915 based on Foata normal form. 328/13476 useless extension candidates. Maximal degree in co-relation 184996. Up to 4213 conditions per place. [2022-12-06 17:19:14,661 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 893 selfloop transitions, 166 changer transitions 1828/3339 dead transitions. [2022-12-06 17:19:14,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1578 places, 3339 transitions, 181262 flow [2022-12-06 17:19:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 17:19:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 17:19:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 16077 transitions. [2022-12-06 17:19:14,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7483940042826552 [2022-12-06 17:19:14,668 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1163 predicate places. [2022-12-06 17:19:14,668 INFO L495 AbstractCegarLoop]: Abstraction has has 1578 places, 3339 transitions, 181262 flow [2022-12-06 17:19:14,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:19:14,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:19:14,669 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:19:14,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 17:19:14,669 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:19:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:19:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 830490460, now seen corresponding path program 16 times [2022-12-06 17:19:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:19:14,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660939551] [2022-12-06 17:19:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:19:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:19:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:19:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:19:15,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:19:15,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660939551] [2022-12-06 17:19:15,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660939551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:19:15,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:19:15,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:19:15,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642278664] [2022-12-06 17:19:15,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:19:15,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:19:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:19:15,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:19:15,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:19:15,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:19:15,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1578 places, 3339 transitions, 181262 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:19:15,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:19:15,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:19:15,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:19:30,780 INFO L130 PetriNetUnfolder]: 4031/14427 cut-off events. [2022-12-06 17:19:30,780 INFO L131 PetriNetUnfolder]: For 1984390/2085340 co-relation queries the response was YES. [2022-12-06 17:19:30,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258184 conditions, 14427 events. 4031/14427 cut-off events. For 1984390/2085340 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 154364 event pairs, 918 based on Foata normal form. 321/13548 useless extension candidates. Maximal degree in co-relation 192009. Up to 4213 conditions per place. [2022-12-06 17:19:30,959 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 888 selfloop transitions, 163 changer transitions 1869/3372 dead transitions. [2022-12-06 17:19:30,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1608 places, 3372 transitions, 189035 flow [2022-12-06 17:19:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 17:19:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 17:19:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 10932 transitions. [2022-12-06 17:19:30,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7551288250328106 [2022-12-06 17:19:30,964 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1193 predicate places. [2022-12-06 17:19:30,964 INFO L495 AbstractCegarLoop]: Abstraction has has 1608 places, 3372 transitions, 189035 flow [2022-12-06 17:19:30,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:19:30,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:19:30,965 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:19:30,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 17:19:30,965 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:19:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:19:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1005868220, now seen corresponding path program 17 times [2022-12-06 17:19:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:19:30,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104594107] [2022-12-06 17:19:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:19:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:19:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:19:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:19:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:19:31,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104594107] [2022-12-06 17:19:31,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104594107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:19:31,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:19:31,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:19:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586598096] [2022-12-06 17:19:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:19:31,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:19:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:19:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:19:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:19:32,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:19:32,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1608 places, 3372 transitions, 189035 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:19:32,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:19:32,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:19:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:19:48,660 INFO L130 PetriNetUnfolder]: 4092/14774 cut-off events. [2022-12-06 17:19:48,660 INFO L131 PetriNetUnfolder]: For 2082407/2184104 co-relation queries the response was YES. [2022-12-06 17:19:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266279 conditions, 14774 events. 4092/14774 cut-off events. For 2082407/2184104 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 157295 event pairs, 893 based on Foata normal form. 333/13931 useless extension candidates. Maximal degree in co-relation 244049. Up to 4156 conditions per place. [2022-12-06 17:19:48,848 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 888 selfloop transitions, 161 changer transitions 1912/3413 dead transitions. [2022-12-06 17:19:48,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1641 places, 3413 transitions, 197537 flow [2022-12-06 17:19:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 17:19:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 17:19:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 11959 transitions. [2022-12-06 17:19:48,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7531805013225847 [2022-12-06 17:19:48,855 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1226 predicate places. [2022-12-06 17:19:48,855 INFO L495 AbstractCegarLoop]: Abstraction has has 1641 places, 3413 transitions, 197537 flow [2022-12-06 17:19:48,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:19:48,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:19:48,857 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:19:48,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 17:19:48,857 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:19:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:19:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash -931302176, now seen corresponding path program 18 times [2022-12-06 17:19:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:19:48,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026152059] [2022-12-06 17:19:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:19:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:19:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:19:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:19:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:19:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026152059] [2022-12-06 17:19:49,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026152059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:19:49,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:19:49,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:19:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767133904] [2022-12-06 17:19:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:19:49,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:19:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:19:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:19:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:19:49,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:19:49,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1641 places, 3413 transitions, 197537 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:19:49,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:19:49,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:19:49,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:06,790 INFO L130 PetriNetUnfolder]: 4092/14729 cut-off events. [2022-12-06 17:20:06,790 INFO L131 PetriNetUnfolder]: For 2147135/2254400 co-relation queries the response was YES. [2022-12-06 17:20:06,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273804 conditions, 14729 events. 4092/14729 cut-off events. For 2147135/2254400 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 156762 event pairs, 940 based on Foata normal form. 327/13887 useless extension candidates. Maximal degree in co-relation 251153. Up to 4156 conditions per place. [2022-12-06 17:20:06,990 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 855 selfloop transitions, 133 changer transitions 1972/3412 dead transitions. [2022-12-06 17:20:06,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1680 places, 3412 transitions, 203173 flow [2022-12-06 17:20:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 17:20:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 17:20:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 14016 transitions. [2022-12-06 17:20:06,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.750321199143469 [2022-12-06 17:20:06,996 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1265 predicate places. [2022-12-06 17:20:06,996 INFO L495 AbstractCegarLoop]: Abstraction has has 1680 places, 3412 transitions, 203173 flow [2022-12-06 17:20:06,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:06,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:06,998 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:20:06,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 17:20:06,998 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:20:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1205677512, now seen corresponding path program 19 times [2022-12-06 17:20:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:06,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277557612] [2022-12-06 17:20:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:20:07,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:07,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277557612] [2022-12-06 17:20:07,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277557612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:07,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:07,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:20:07,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727533099] [2022-12-06 17:20:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:07,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:20:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:07,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:20:07,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:20:07,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:20:07,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1680 places, 3412 transitions, 203173 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:07,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:07,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:20:07,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:27,065 INFO L130 PetriNetUnfolder]: 4139/14784 cut-off events. [2022-12-06 17:20:27,066 INFO L131 PetriNetUnfolder]: For 2271341/2389545 co-relation queries the response was YES. [2022-12-06 17:20:27,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291174 conditions, 14784 events. 4139/14784 cut-off events. For 2271341/2389545 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 159010 event pairs, 938 based on Foata normal form. 329/13896 useless extension candidates. Maximal degree in co-relation 217414. Up to 4213 conditions per place. [2022-12-06 17:20:27,406 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 917 selfloop transitions, 159 changer transitions 2060/3588 dead transitions. [2022-12-06 17:20:27,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1732 places, 3588 transitions, 221005 flow [2022-12-06 17:20:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 17:20:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 17:20:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 18482 transitions. [2022-12-06 17:20:27,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7467173043513393 [2022-12-06 17:20:27,414 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1317 predicate places. [2022-12-06 17:20:27,414 INFO L495 AbstractCegarLoop]: Abstraction has has 1732 places, 3588 transitions, 221005 flow [2022-12-06 17:20:27,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:27,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:27,415 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:20:27,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 17:20:27,415 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:20:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:27,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1754977876, now seen corresponding path program 20 times [2022-12-06 17:20:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:27,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227326483] [2022-12-06 17:20:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:20:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:28,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227326483] [2022-12-06 17:20:28,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227326483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:28,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:28,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:20:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462325979] [2022-12-06 17:20:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:20:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:20:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:20:28,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:20:28,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1732 places, 3588 transitions, 221005 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:28,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:28,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:20:28,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:47,641 INFO L130 PetriNetUnfolder]: 4248/15225 cut-off events. [2022-12-06 17:20:47,641 INFO L131 PetriNetUnfolder]: For 2386851/2504860 co-relation queries the response was YES. [2022-12-06 17:20:47,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303180 conditions, 15225 events. 4248/15225 cut-off events. For 2386851/2504860 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 163001 event pairs, 922 based on Foata normal form. 331/14374 useless extension candidates. Maximal degree in co-relation 278874. Up to 4156 conditions per place. [2022-12-06 17:20:47,855 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 959 selfloop transitions, 188 changer transitions 2122/3721 dead transitions. [2022-12-06 17:20:47,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1777 places, 3721 transitions, 236852 flow [2022-12-06 17:20:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 17:20:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 17:20:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 16073 transitions. [2022-12-06 17:20:47,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7482078018806443 [2022-12-06 17:20:47,861 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1362 predicate places. [2022-12-06 17:20:47,862 INFO L495 AbstractCegarLoop]: Abstraction has has 1777 places, 3721 transitions, 236852 flow [2022-12-06 17:20:47,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:47,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:47,863 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:20:47,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 17:20:47,863 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:20:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1816430764, now seen corresponding path program 21 times [2022-12-06 17:20:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:47,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510186989] [2022-12-06 17:20:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:47,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:20:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:48,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510186989] [2022-12-06 17:20:48,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510186989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:48,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:48,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:20:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739439046] [2022-12-06 17:20:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:48,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:20:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:20:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:20:48,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:20:48,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1777 places, 3721 transitions, 236852 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:48,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:48,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:20:48,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:21:11,222 INFO L130 PetriNetUnfolder]: 4284/15224 cut-off events. [2022-12-06 17:21:11,222 INFO L131 PetriNetUnfolder]: For 2513433/2643417 co-relation queries the response was YES. [2022-12-06 17:21:11,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320415 conditions, 15224 events. 4284/15224 cut-off events. For 2513433/2643417 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 164849 event pairs, 914 based on Foata normal form. 344/14344 useless extension candidates. Maximal degree in co-relation 239254. Up to 4213 conditions per place. [2022-12-06 17:21:11,549 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 1000 selfloop transitions, 215 changer transitions 2210/3877 dead transitions. [2022-12-06 17:21:11,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1829 places, 3877 transitions, 254582 flow [2022-12-06 17:21:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 17:21:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 17:21:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 18493 transitions. [2022-12-06 17:21:11,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.747161730839158 [2022-12-06 17:21:11,569 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1414 predicate places. [2022-12-06 17:21:11,569 INFO L495 AbstractCegarLoop]: Abstraction has has 1829 places, 3877 transitions, 254582 flow [2022-12-06 17:21:11,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:21:11,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:11,571 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:21:11,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 17:21:11,571 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:21:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -263792268, now seen corresponding path program 22 times [2022-12-06 17:21:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:11,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097646958] [2022-12-06 17:21:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:11,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:21:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097646958] [2022-12-06 17:21:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097646958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:21:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:21:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:21:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436568341] [2022-12-06 17:21:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:21:12,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:21:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:21:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:21:12,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:21:12,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1829 places, 3877 transitions, 254582 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:21:12,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:12,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:21:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:21:34,740 INFO L130 PetriNetUnfolder]: 4306/15290 cut-off events. [2022-12-06 17:21:34,740 INFO L131 PetriNetUnfolder]: For 2617879/2754222 co-relation queries the response was YES. [2022-12-06 17:21:34,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331491 conditions, 15290 events. 4306/15290 cut-off events. For 2617879/2754222 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 165932 event pairs, 912 based on Foata normal form. 323/14389 useless extension candidates. Maximal degree in co-relation 247393. Up to 4213 conditions per place. [2022-12-06 17:21:34,947 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 1015 selfloop transitions, 192 changer transitions 2281/3940 dead transitions. [2022-12-06 17:21:34,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1878 places, 3940 transitions, 266161 flow [2022-12-06 17:21:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 17:21:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 17:21:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 17453 transitions. [2022-12-06 17:21:34,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7474518201284797 [2022-12-06 17:21:34,954 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1463 predicate places. [2022-12-06 17:21:34,954 INFO L495 AbstractCegarLoop]: Abstraction has has 1878 places, 3940 transitions, 266161 flow [2022-12-06 17:21:34,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:21:34,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:34,955 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:21:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 17:21:34,955 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:21:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 920563796, now seen corresponding path program 23 times [2022-12-06 17:21:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:34,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037163488] [2022-12-06 17:21:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:21:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:35,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037163488] [2022-12-06 17:21:35,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037163488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:21:35,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:21:35,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:21:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417757031] [2022-12-06 17:21:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:21:35,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:21:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:21:35,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:21:35,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:21:35,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1878 places, 3940 transitions, 266161 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:21:35,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:35,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:21:35,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:00,154 INFO L130 PetriNetUnfolder]: 4399/15762 cut-off events. [2022-12-06 17:22:00,154 INFO L131 PetriNetUnfolder]: For 2757248/2891751 co-relation queries the response was YES. [2022-12-06 17:22:00,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343147 conditions, 15762 events. 4399/15762 cut-off events. For 2757248/2891751 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 170455 event pairs, 918 based on Foata normal form. 337/14902 useless extension candidates. Maximal degree in co-relation 316093. Up to 4156 conditions per place. [2022-12-06 17:22:00,396 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 1012 selfloop transitions, 234 changer transitions 2343/4041 dead transitions. [2022-12-06 17:22:00,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1923 places, 4041 transitions, 281014 flow [2022-12-06 17:22:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 17:22:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 17:22:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 16075 transitions. [2022-12-06 17:22:00,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7483009030816498 [2022-12-06 17:22:00,408 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1508 predicate places. [2022-12-06 17:22:00,409 INFO L495 AbstractCegarLoop]: Abstraction has has 1923 places, 4041 transitions, 281014 flow [2022-12-06 17:22:00,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:00,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:00,410 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:00,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 17:22:00,410 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1896323122, now seen corresponding path program 24 times [2022-12-06 17:22:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:00,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664028068] [2022-12-06 17:22:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:22:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:00,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664028068] [2022-12-06 17:22:00,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664028068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:22:00,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:22:00,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:22:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035924293] [2022-12-06 17:22:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:22:00,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:22:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:00,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:22:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:22:00,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:22:00,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1923 places, 4041 transitions, 281014 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:00,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:00,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:22:00,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:27,820 INFO L130 PetriNetUnfolder]: 4399/15743 cut-off events. [2022-12-06 17:22:27,820 INFO L131 PetriNetUnfolder]: For 2840342/2979781 co-relation queries the response was YES. [2022-12-06 17:22:27,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351572 conditions, 15743 events. 4399/15743 cut-off events. For 2840342/2979781 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 170065 event pairs, 926 based on Foata normal form. 353/14898 useless extension candidates. Maximal degree in co-relation 324061. Up to 4156 conditions per place. [2022-12-06 17:22:28,044 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 946 selfloop transitions, 206 changer transitions 2436/4040 dead transitions. [2022-12-06 17:22:28,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1978 places, 4040 transitions, 287894 flow [2022-12-06 17:22:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-06 17:22:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-06 17:22:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 19519 transitions. [2022-12-06 17:22:28,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7463673906393392 [2022-12-06 17:22:28,052 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1563 predicate places. [2022-12-06 17:22:28,052 INFO L495 AbstractCegarLoop]: Abstraction has has 1978 places, 4040 transitions, 287894 flow [2022-12-06 17:22:28,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:28,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:28,053 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:28,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 17:22:28,054 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash 755194188, now seen corresponding path program 25 times [2022-12-06 17:22:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:28,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396389612] [2022-12-06 17:22:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:22:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:28,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396389612] [2022-12-06 17:22:28,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396389612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:22:28,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:22:28,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:22:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724511022] [2022-12-06 17:22:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:22:28,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:22:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:22:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:22:28,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:22:28,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1978 places, 4040 transitions, 287894 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:28,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:28,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:22:28,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:52,626 INFO L130 PetriNetUnfolder]: 4364/15522 cut-off events. [2022-12-06 17:22:52,626 INFO L131 PetriNetUnfolder]: For 2937842/3090940 co-relation queries the response was YES. [2022-12-06 17:22:52,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363289 conditions, 15522 events. 4364/15522 cut-off events. For 2937842/3090940 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 168835 event pairs, 936 based on Foata normal form. 324/14623 useless extension candidates. Maximal degree in co-relation 272374. Up to 4213 conditions per place. [2022-12-06 17:22:52,848 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 942 selfloop transitions, 202 changer transitions 2477/4073 dead transitions. [2022-12-06 17:22:52,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2008 places, 4073 transitions, 297663 flow [2022-12-06 17:22:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 17:22:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 17:22:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 10930 transitions. [2022-12-06 17:22:52,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7549906748635767 [2022-12-06 17:22:52,853 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1593 predicate places. [2022-12-06 17:22:52,853 INFO L495 AbstractCegarLoop]: Abstraction has has 2008 places, 4073 transitions, 297663 flow [2022-12-06 17:22:52,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:52,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:52,854 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:52,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 17:22:52,854 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1686376602, now seen corresponding path program 26 times [2022-12-06 17:22:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:52,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799680845] [2022-12-06 17:22:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:22:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:53,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799680845] [2022-12-06 17:22:53,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799680845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:22:53,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:22:53,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:22:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77825274] [2022-12-06 17:22:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:22:53,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:22:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:53,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:22:53,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:22:53,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:22:53,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2008 places, 4073 transitions, 297663 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:53,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:53,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:22:53,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:23:18,692 INFO L130 PetriNetUnfolder]: 4383/15581 cut-off events. [2022-12-06 17:23:18,693 INFO L131 PetriNetUnfolder]: For 3061776/3220233 co-relation queries the response was YES. [2022-12-06 17:23:18,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374130 conditions, 15581 events. 4383/15581 cut-off events. For 3061776/3220233 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 169647 event pairs, 910 based on Foata normal form. 319/14679 useless extension candidates. Maximal degree in co-relation 280762. Up to 4213 conditions per place. [2022-12-06 17:23:19,067 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 959 selfloop transitions, 192 changer transitions 2519/4122 dead transitions. [2022-12-06 17:23:19,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2041 places, 4122 transitions, 309046 flow [2022-12-06 17:23:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 17:23:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 17:23:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 11955 transitions. [2022-12-06 17:23:19,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7529285804257463 [2022-12-06 17:23:19,072 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1626 predicate places. [2022-12-06 17:23:19,073 INFO L495 AbstractCegarLoop]: Abstraction has has 2041 places, 4122 transitions, 309046 flow [2022-12-06 17:23:19,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:23:19,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:23:19,073 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:23:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 17:23:19,074 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:23:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:23:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash -474107296, now seen corresponding path program 27 times [2022-12-06 17:23:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:23:19,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051143068] [2022-12-06 17:23:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:23:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:23:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:23:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:23:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:23:19,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051143068] [2022-12-06 17:23:19,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051143068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:23:19,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:23:19,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:23:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283709619] [2022-12-06 17:23:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:23:19,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:23:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:23:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:23:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:23:19,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:23:19,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2041 places, 4122 transitions, 309046 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:23:19,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:23:19,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:23:19,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:23:45,490 INFO L130 PetriNetUnfolder]: 4398/15659 cut-off events. [2022-12-06 17:23:45,490 INFO L131 PetriNetUnfolder]: For 3169550/3333577 co-relation queries the response was YES. [2022-12-06 17:23:45,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384969 conditions, 15659 events. 4398/15659 cut-off events. For 3169550/3333577 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 170786 event pairs, 906 based on Foata normal form. 320/14758 useless extension candidates. Maximal degree in co-relation 289238. Up to 4213 conditions per place. [2022-12-06 17:23:45,712 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 947 selfloop transitions, 202 changer transitions 2562/4163 dead transitions. [2022-12-06 17:23:45,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2074 places, 4163 transitions, 319868 flow [2022-12-06 17:23:45,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 17:23:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 17:23:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 11957 transitions. [2022-12-06 17:23:45,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7530545408741655 [2022-12-06 17:23:45,717 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1659 predicate places. [2022-12-06 17:23:45,717 INFO L495 AbstractCegarLoop]: Abstraction has has 2074 places, 4163 transitions, 319868 flow [2022-12-06 17:23:45,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:23:45,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:23:45,718 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:23:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 17:23:45,719 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:23:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:23:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1002183636, now seen corresponding path program 28 times [2022-12-06 17:23:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:23:45,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66957117] [2022-12-06 17:23:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:23:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:23:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:23:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:23:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:23:46,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66957117] [2022-12-06 17:23:46,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66957117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:23:46,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:23:46,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:23:46,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629440391] [2022-12-06 17:23:46,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:23:46,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:23:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:23:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:23:46,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:23:46,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:23:46,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2074 places, 4163 transitions, 319868 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:23:46,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:23:46,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:23:46,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:24:13,826 INFO L130 PetriNetUnfolder]: 4443/15948 cut-off events. [2022-12-06 17:24:13,826 INFO L131 PetriNetUnfolder]: For 3303257/3464979 co-relation queries the response was YES. [2022-12-06 17:24:14,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391923 conditions, 15948 events. 4443/15948 cut-off events. For 3303257/3464979 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 173209 event pairs, 919 based on Foata normal form. 340/15096 useless extension candidates. Maximal degree in co-relation 361320. Up to 4156 conditions per place. [2022-12-06 17:24:14,236 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 926 selfloop transitions, 179 changer transitions 2615/4172 dead transitions. [2022-12-06 17:24:14,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2113 places, 4172 transitions, 328002 flow [2022-12-06 17:24:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 17:24:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 17:24:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 14014 transitions. [2022-12-06 17:24:14,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7502141327623126 [2022-12-06 17:24:14,247 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1698 predicate places. [2022-12-06 17:24:14,247 INFO L495 AbstractCegarLoop]: Abstraction has has 2113 places, 4172 transitions, 328002 flow [2022-12-06 17:24:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:24:14,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:24:14,253 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:24:14,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 17:24:14,253 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:24:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:24:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1477793366, now seen corresponding path program 29 times [2022-12-06 17:24:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:24:14,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885530287] [2022-12-06 17:24:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:24:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:24:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:24:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:24:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:24:15,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885530287] [2022-12-06 17:24:15,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885530287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:24:15,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:24:15,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:24:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785698300] [2022-12-06 17:24:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:24:15,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:24:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:24:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:24:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:24:15,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:24:15,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2113 places, 4172 transitions, 328002 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:24:15,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:24:15,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:24:15,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:24:43,266 INFO L130 PetriNetUnfolder]: 4443/15998 cut-off events. [2022-12-06 17:24:43,266 INFO L131 PetriNetUnfolder]: For 3405666/3571666 co-relation queries the response was YES. [2022-12-06 17:24:43,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400891 conditions, 15998 events. 4443/15998 cut-off events. For 3405666/3571666 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 173884 event pairs, 946 based on Foata normal form. 332/15137 useless extension candidates. Maximal degree in co-relation 369817. Up to 4156 conditions per place. [2022-12-06 17:24:43,501 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 882 selfloop transitions, 148 changer transitions 2689/4171 dead transitions. [2022-12-06 17:24:43,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2162 places, 4171 transitions, 335134 flow [2022-12-06 17:24:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 17:24:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 17:24:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 17454 transitions. [2022-12-06 17:24:43,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7474946466809422 [2022-12-06 17:24:43,508 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1747 predicate places. [2022-12-06 17:24:43,508 INFO L495 AbstractCegarLoop]: Abstraction has has 2162 places, 4171 transitions, 335134 flow [2022-12-06 17:24:43,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:24:43,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:24:43,509 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:24:43,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 17:24:43,510 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:24:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:24:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 775103506, now seen corresponding path program 30 times [2022-12-06 17:24:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:24:43,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963704360] [2022-12-06 17:24:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:24:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:24:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:24:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:24:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:24:44,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963704360] [2022-12-06 17:24:44,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963704360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:24:44,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:24:44,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:24:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017317302] [2022-12-06 17:24:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:24:44,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:24:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:24:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:24:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:24:44,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:24:44,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2162 places, 4171 transitions, 335134 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:24:44,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:24:44,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:24:44,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:25:11,389 INFO L130 PetriNetUnfolder]: 4450/16031 cut-off events. [2022-12-06 17:25:11,390 INFO L131 PetriNetUnfolder]: For 3534148/3706270 co-relation queries the response was YES. [2022-12-06 17:25:11,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410592 conditions, 16031 events. 4450/16031 cut-off events. For 3534148/3706270 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 174093 event pairs, 922 based on Foata normal form. 335/15172 useless extension candidates. Maximal degree in co-relation 378716. Up to 4156 conditions per place. [2022-12-06 17:25:11,800 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 859 selfloop transitions, 154 changer transitions 2731/4196 dead transitions. [2022-12-06 17:25:11,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2192 places, 4196 transitions, 344690 flow [2022-12-06 17:25:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 17:25:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 17:25:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 10928 transitions. [2022-12-06 17:25:11,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7548525246943427 [2022-12-06 17:25:11,805 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1777 predicate places. [2022-12-06 17:25:11,805 INFO L495 AbstractCegarLoop]: Abstraction has has 2192 places, 4196 transitions, 344690 flow [2022-12-06 17:25:11,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:25:11,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:25:11,806 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:25:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 17:25:11,807 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:25:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:25:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash 654333710, now seen corresponding path program 31 times [2022-12-06 17:25:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:25:11,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971292477] [2022-12-06 17:25:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:25:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:25:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:25:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:25:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:25:12,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971292477] [2022-12-06 17:25:12,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971292477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:25:12,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:25:12,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:25:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619067787] [2022-12-06 17:25:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:25:12,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:25:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:25:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:25:12,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:25:12,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:25:12,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2192 places, 4196 transitions, 344690 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:25:12,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:25:12,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:25:12,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:25:40,488 INFO L130 PetriNetUnfolder]: 4404/15740 cut-off events. [2022-12-06 17:25:40,488 INFO L131 PetriNetUnfolder]: For 3630036/3816514 co-relation queries the response was YES. [2022-12-06 17:25:40,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421254 conditions, 15740 events. 4404/15740 cut-off events. For 3630036/3816514 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 172020 event pairs, 915 based on Foata normal form. 332/14848 useless extension candidates. Maximal degree in co-relation 318308. Up to 4213 conditions per place. [2022-12-06 17:25:40,726 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 829 selfloop transitions, 127 changer transitions 2787/4195 dead transitions. [2022-12-06 17:25:40,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2231 places, 4195 transitions, 351866 flow [2022-12-06 17:25:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 17:25:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 17:25:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 14012 transitions. [2022-12-06 17:25:40,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7501070663811563 [2022-12-06 17:25:40,732 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1816 predicate places. [2022-12-06 17:25:40,732 INFO L495 AbstractCegarLoop]: Abstraction has has 2231 places, 4195 transitions, 351866 flow [2022-12-06 17:25:40,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:25:40,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:25:40,733 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:25:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 17:25:40,733 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:25:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:25:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1092116070, now seen corresponding path program 32 times [2022-12-06 17:25:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:25:40,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956032089] [2022-12-06 17:25:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:25:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:25:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:25:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:25:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:25:41,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956032089] [2022-12-06 17:25:41,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956032089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:25:41,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:25:41,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:25:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792829138] [2022-12-06 17:25:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:25:41,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:25:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:25:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:25:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:25:41,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:25:41,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2231 places, 4195 transitions, 351866 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:25:41,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:25:41,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:25:41,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:26:11,563 INFO L130 PetriNetUnfolder]: 4458/15899 cut-off events. [2022-12-06 17:26:11,563 INFO L131 PetriNetUnfolder]: For 3778317/3970790 co-relation queries the response was YES. [2022-12-06 17:26:11,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436398 conditions, 15899 events. 4458/15899 cut-off events. For 3778317/3970790 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 174069 event pairs, 914 based on Foata normal form. 326/15003 useless extension candidates. Maximal degree in co-relation 330004. Up to 4213 conditions per place. [2022-12-06 17:26:11,863 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 857 selfloop transitions, 151 changer transitions 2849/4309 dead transitions. [2022-12-06 17:26:11,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2275 places, 4309 transitions, 370305 flow [2022-12-06 17:26:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-06 17:26:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-06 17:26:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 15724 transitions. [2022-12-06 17:26:11,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7482274565786343 [2022-12-06 17:26:11,869 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1860 predicate places. [2022-12-06 17:26:11,869 INFO L495 AbstractCegarLoop]: Abstraction has has 2275 places, 4309 transitions, 370305 flow [2022-12-06 17:26:11,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:26:11,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:26:11,870 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:26:11,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 17:26:11,870 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:26:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:26:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash 859077976, now seen corresponding path program 33 times [2022-12-06 17:26:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:26:11,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061407618] [2022-12-06 17:26:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:26:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:26:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:26:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:26:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:26:12,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061407618] [2022-12-06 17:26:12,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061407618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:26:12,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:26:12,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:26:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833704755] [2022-12-06 17:26:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:26:12,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:26:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:26:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:26:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:26:12,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:26:12,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2275 places, 4309 transitions, 370305 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:26:12,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:26:12,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:26:12,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:26:46,057 INFO L130 PetriNetUnfolder]: 4493/16061 cut-off events. [2022-12-06 17:26:46,057 INFO L131 PetriNetUnfolder]: For 3924250/4122050 co-relation queries the response was YES. [2022-12-06 17:26:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449953 conditions, 16061 events. 4493/16061 cut-off events. For 3924250/4122050 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 176265 event pairs, 917 based on Foata normal form. 324/15161 useless extension candidates. Maximal degree in co-relation 340498. Up to 4213 conditions per place. [2022-12-06 17:26:46,307 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 877 selfloop transitions, 162 changer transitions 2899/4390 dead transitions. [2022-12-06 17:26:46,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2314 places, 4390 transitions, 386169 flow [2022-12-06 17:26:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 17:26:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 17:26:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 14009 transitions. [2022-12-06 17:26:46,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7499464668094219 [2022-12-06 17:26:46,313 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1899 predicate places. [2022-12-06 17:26:46,313 INFO L495 AbstractCegarLoop]: Abstraction has has 2314 places, 4390 transitions, 386169 flow [2022-12-06 17:26:46,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:26:46,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:26:46,314 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:26:46,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 17:26:46,314 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:26:46,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:26:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash 137766534, now seen corresponding path program 34 times [2022-12-06 17:26:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:26:46,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533854943] [2022-12-06 17:26:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:26:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:26:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:26:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:26:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:26:47,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533854943] [2022-12-06 17:26:47,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533854943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:26:47,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:26:47,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:26:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201698561] [2022-12-06 17:26:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:26:47,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:26:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:26:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:26:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:26:47,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:26:47,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2314 places, 4390 transitions, 386169 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:26:47,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:26:47,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:26:47,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:27:21,112 INFO L130 PetriNetUnfolder]: 4566/16397 cut-off events. [2022-12-06 17:27:21,112 INFO L131 PetriNetUnfolder]: For 4057293/4250979 co-relation queries the response was YES. [2022-12-06 17:27:21,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460148 conditions, 16397 events. 4566/16397 cut-off events. For 4057293/4250979 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 179117 event pairs, 924 based on Foata normal form. 310/15519 useless extension candidates. Maximal degree in co-relation 425321. Up to 4156 conditions per place. [2022-12-06 17:27:21,529 INFO L137 encePairwiseOnDemand]: 437/467 looper letters, 866 selfloop transitions, 164 changer transitions 2969/4451 dead transitions. [2022-12-06 17:27:21,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2363 places, 4451 transitions, 400039 flow [2022-12-06 17:27:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 17:27:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 17:27:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 17443 transitions. [2022-12-06 17:27:21,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7470235546038544 [2022-12-06 17:27:21,537 INFO L294 CegarLoopForPetriNet]: 415 programPoint places, 1948 predicate places. [2022-12-06 17:27:21,537 INFO L495 AbstractCegarLoop]: Abstraction has has 2363 places, 4451 transitions, 400039 flow [2022-12-06 17:27:21,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:27:21,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:27:21,538 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:27:21,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 17:27:21,538 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:27:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:27:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1041233916, now seen corresponding path program 35 times [2022-12-06 17:27:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:27:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220598609] [2022-12-06 17:27:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:27:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:27:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:27:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-06 17:27:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:27:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220598609] [2022-12-06 17:27:22,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220598609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:27:22,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:27:22,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 17:27:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745915700] [2022-12-06 17:27:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:27:22,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:27:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:27:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:27:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:27:22,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 467 [2022-12-06 17:27:22,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2363 places, 4451 transitions, 400039 flow. Second operand has 20 states, 20 states have (on average 343.2) internal successors, (6864), 20 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:27:22,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:27:22,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 467 [2022-12-06 17:27:22,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 17:27:47,736 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:27:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 17:27:47,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 17:27:47,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 17:27:47,784 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 340/467 universal loopers) in iteration 78,while PetriNetUnfolder was constructing finite prefix that currently has 320960 conditions, 10506 events (2966/10505 cut-off events. For 2623868/2683034 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 117845 event pairs, 408 based on Foata normal form. 157/10425 useless extension candidates. Maximal degree in co-relation 268440. Up to 2836 conditions per place.). [2022-12-06 17:27:47,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 17:27:47,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 17:27:47,786 INFO L458 BasicCegarLoop]: Path program histogram: [35, 12, 10, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1] [2022-12-06 17:27:47,789 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:27:47,789 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:27:47,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:27:47 BasicIcfg [2022-12-06 17:27:47,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:27:47,793 INFO L158 Benchmark]: Toolchain (without parser) took 775850.29ms. Allocated memory was 185.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 148.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 17:27:47,793 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:27:47,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.98ms. Allocated memory is still 185.6MB. Free memory was 148.7MB in the beginning and 135.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 17:27:47,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.53ms. Allocated memory is still 185.6MB. Free memory was 135.1MB in the beginning and 131.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 17:27:47,794 INFO L158 Benchmark]: Boogie Preprocessor took 33.49ms. Allocated memory is still 185.6MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:27:47,794 INFO L158 Benchmark]: RCFGBuilder took 764.88ms. Allocated memory is still 185.6MB. Free memory was 129.8MB in the beginning and 97.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 17:27:47,794 INFO L158 Benchmark]: TraceAbstraction took 774622.72ms. Allocated memory was 185.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 96.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-06 17:27:47,796 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.98ms. Allocated memory is still 185.6MB. Free memory was 148.7MB in the beginning and 135.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.53ms. Allocated memory is still 185.6MB. Free memory was 135.1MB in the beginning and 131.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.49ms. Allocated memory is still 185.6MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 764.88ms. Allocated memory is still 185.6MB. Free memory was 129.8MB in the beginning and 97.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 774622.72ms. Allocated memory was 185.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 96.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 340/467 universal loopers) in iteration 78,while PetriNetUnfolder was constructing finite prefix that currently has 320960 conditions, 10506 events (2966/10505 cut-off events. For 2623868/2683034 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 117845 event pairs, 408 based on Foata normal form. 157/10425 useless extension candidates. Maximal degree in co-relation 268440. Up to 2836 conditions per place.). - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 340/467 universal loopers) in iteration 78,while PetriNetUnfolder was constructing finite prefix that currently has 320960 conditions, 10506 events (2966/10505 cut-off events. For 2623868/2683034 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 117845 event pairs, 408 based on Foata normal form. 157/10425 useless extension candidates. Maximal degree in co-relation 268440. Up to 2836 conditions per place.). - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 340/467 universal loopers) in iteration 78,while PetriNetUnfolder was constructing finite prefix that currently has 320960 conditions, 10506 events (2966/10505 cut-off events. For 2623868/2683034 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 117845 event pairs, 408 based on Foata normal form. 157/10425 useless extension candidates. Maximal degree in co-relation 268440. Up to 2836 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 691 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 774.4s, OverallIterations: 78, TraceHistogramMax: 5, PathProgramHistogramMax: 35, EmptinessCheckTime: 0.0s, AutomataDifference: 735.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19351 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19351 mSDsluCounter, 151107 SdHoareTripleChecker+Invalid, 23.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138465 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54710 IncrementalHoareTripleChecker+Invalid, 55186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 12642 mSDtfsCounter, 54710 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4006 GetRequests, 1426 SyntacticMatches, 5 SemanticMatches, 2575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22922 ImplicationChecksByTransitivity, 71.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400039occurred in iteration=77, InterpolantAutomatonStates: 2025, 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.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 18894 NumberOfCodeBlocks, 18799 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 19172 ConstructedInterpolants, 0 QuantifiedInterpolants, 52336 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1381 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 84 InterpolantComputations, 76 PerfectInterpolantSequences, 9422/9530 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 could not prove your program: Timeout Completed graceful shutdown