/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:26:14,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:26:14,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:26:14,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:26:14,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:26:14,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:26:14,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:26:14,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:26:14,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:26:14,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:26:14,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:26:14,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:26:14,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:26:14,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:26:14,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:26:14,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:26:14,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:26:14,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:26:14,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:26:14,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:26:14,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:26:14,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:26:14,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:26:14,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:26:14,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:26:14,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:26:14,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:26:14,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:26:14,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:26:14,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:26:14,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:26:14,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:26:14,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:26:14,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:26:14,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:26:14,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:26:14,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:26:14,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:26:14,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:26:14,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:26:14,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:26:14,450 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:26:14,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:26:14,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:26:14,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:26:14,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:26:14,472 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:26:14,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:26:14,473 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:26:14,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:26:14,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:26:14,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:26:14,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:26:14,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:26:14,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:26:14,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:26:14,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:26:14,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:26:14,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:26:14,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:26:14,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:26:14,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:26:14,475 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 [2022-12-06 07:26:14,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:26:14,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:26:14,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:26:14,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:26:14,754 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:26:14,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-12-06 07:26:15,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:26:15,887 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:26:15,888 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-12-06 07:26:15,899 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d38316dc/d498ca69a77c476bbc0d946639029f8f/FLAG5af743ddd [2022-12-06 07:26:15,911 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d38316dc/d498ca69a77c476bbc0d946639029f8f [2022-12-06 07:26:15,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:26:15,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:26:15,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:26:15,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:26:15,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:26:15,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:26:15" (1/1) ... [2022-12-06 07:26:15,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113a04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:15, skipping insertion in model container [2022-12-06 07:26:15,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:26:15" (1/1) ... [2022-12-06 07:26:15,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:26:15,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:26:16,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,113 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/parallel-bakery-3.wvr.c[5426,5439] [2022-12-06 07:26:16,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:26:16,124 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:26:16,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:26:16,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:26:16,173 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/parallel-bakery-3.wvr.c[5426,5439] [2022-12-06 07:26:16,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:26:16,188 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:26:16,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16 WrapperNode [2022-12-06 07:26:16,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:26:16,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:26:16,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:26:16,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:26:16,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,239 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 255 [2022-12-06 07:26:16,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:26:16,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:26:16,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:26:16,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:26:16,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:26:16,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:26:16,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:26:16,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:26:16,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (1/1) ... [2022-12-06 07:26:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:26:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:16,289 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 07:26:16,295 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 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:26:16,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:26:16,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:26:16,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:26:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:26:16,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:26:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:26:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:26:16,320 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 07:26:16,385 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:26:16,387 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:26:16,621 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:26:16,756 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:26:16,756 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 07:26:16,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:26:16 BoogieIcfgContainer [2022-12-06 07:26:16,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:26:16,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:26:16,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:26:16,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:26:16,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:26:15" (1/3) ... [2022-12-06 07:26:16,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c030d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:26:16, skipping insertion in model container [2022-12-06 07:26:16,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:26:16" (2/3) ... [2022-12-06 07:26:16,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c030d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:26:16, skipping insertion in model container [2022-12-06 07:26:16,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:26:16" (3/3) ... [2022-12-06 07:26:16,765 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2022-12-06 07:26:16,778 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:26:16,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:26:16,778 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:26:16,853 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:26:16,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 145 transitions, 314 flow [2022-12-06 07:26:16,999 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-06 07:26:16,999 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:26:17,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 07:26:17,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 145 transitions, 314 flow [2022-12-06 07:26:17,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 132 transitions, 282 flow [2022-12-06 07:26:17,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 282 flow [2022-12-06 07:26:17,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 282 flow [2022-12-06 07:26:17,053 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-06 07:26:17,053 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:26:17,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 07:26:17,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 282 flow [2022-12-06 07:26:17,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 2184 [2022-12-06 07:26:20,843 INFO L203 LiptonReduction]: Total number of compositions: 89 [2022-12-06 07:26:20,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:26:20,858 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=REPEATED_LIPTON_PN, 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;@8c8eb41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:26:20,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:26:20,864 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-06 07:26:20,864 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:26:20,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,865 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] [2022-12-06 07:26:20,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 748936163, now seen corresponding path program 1 times [2022-12-06 07:26:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917884761] [2022-12-06 07:26:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,431 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 07:26:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917884761] [2022-12-06 07:26:21,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917884761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:26:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001398838] [2022-12-06 07:26:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:26:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:26:21,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:26:21,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-06 07:26:21,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 104 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 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 07:26:21,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-06 07:26:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,544 INFO L130 PetriNetUnfolder]: 6197/9388 cut-off events. [2022-12-06 07:26:22,544 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-06 07:26:22,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19181 conditions, 9388 events. 6197/9388 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 50152 event pairs, 2421 based on Foata normal form. 1/9371 useless extension candidates. Maximal degree in co-relation 16901. Up to 3168 conditions per place. [2022-12-06 07:26:22,595 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 158 selfloop transitions, 15 changer transitions 22/198 dead transitions. [2022-12-06 07:26:22,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 198 transitions, 858 flow [2022-12-06 07:26:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:26:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:26:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2022-12-06 07:26:22,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48414376321353064 [2022-12-06 07:26:22,609 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 104 flow. Second operand 11 states and 229 transitions. [2022-12-06 07:26:22,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 198 transitions, 858 flow [2022-12-06 07:26:22,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 198 transitions, 810 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:26:22,624 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 184 flow [2022-12-06 07:26:22,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-06 07:26:22,630 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2022-12-06 07:26:22,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,630 INFO L89 Accepts]: Start accepts. Operand has 61 places, 59 transitions, 184 flow [2022-12-06 07:26:22,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 184 flow [2022-12-06 07:26:22,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 184 flow [2022-12-06 07:26:22,653 INFO L130 PetriNetUnfolder]: 9/125 cut-off events. [2022-12-06 07:26:22,653 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:26:22,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 125 events. 9/125 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 549 event pairs, 2 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 175. Up to 12 conditions per place. [2022-12-06 07:26:22,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 59 transitions, 184 flow [2022-12-06 07:26:22,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-06 07:26:22,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L69-->L73: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] and [522] L116-->L119: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-06 07:26:22,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] L155-->L159: Formula: (= v_~i3~0_1 v_~i~0_5) InVars {~i~0=v_~i~0_5} OutVars{~i3~0=v_~i3~0_1, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i3~0] and [522] L116-->L119: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-06 07:26:22,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] L155-->L159: Formula: (= v_~i3~0_1 v_~i~0_5) InVars {~i~0=v_~i~0_5} OutVars{~i3~0=v_~i3~0_1, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i3~0] and [508] L73-->L76: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-06 07:26:22,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L69-->L119: Formula: (and (= v_~i~0_96 v_~i1~0_65) (= v_~i~0_95 (+ v_~i2~0_55 1))) InVars {~i~0=v_~i~0_96, ~i2~0=v_~i2~0_55} OutVars{~i~0=v_~i~0_95, ~i2~0=v_~i2~0_55, ~i1~0=v_~i1~0_65} AuxVars[] AssignedVars[~i~0, ~i1~0] and [508] L73-->L76: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-06 07:26:22,786 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:26:22,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:26:22,789 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 178 flow [2022-12-06 07:26:22,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 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 07:26:22,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,789 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] [2022-12-06 07:26:22,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:26:22,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 392671169, now seen corresponding path program 2 times [2022-12-06 07:26:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522756588] [2022-12-06 07:26:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:23,359 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 07:26:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522756588] [2022-12-06 07:26:23,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522756588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:26:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669769831] [2022-12-06 07:26:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:26:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:26:23,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:26:23,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 47 [2022-12-06 07:26:23,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 178 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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 07:26:23,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 47 [2022-12-06 07:26:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,968 INFO L130 PetriNetUnfolder]: 5473/8976 cut-off events. [2022-12-06 07:26:23,968 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2022-12-06 07:26:23,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18859 conditions, 8976 events. 5473/8976 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 54337 event pairs, 2675 based on Foata normal form. 124/8901 useless extension candidates. Maximal degree in co-relation 18837. Up to 7344 conditions per place. [2022-12-06 07:26:24,006 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 91 selfloop transitions, 16 changer transitions 2/123 dead transitions. [2022-12-06 07:26:24,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 550 flow [2022-12-06 07:26:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:26:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:26:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-12-06 07:26:24,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2022-12-06 07:26:24,010 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 178 flow. Second operand 8 states and 160 transitions. [2022-12-06 07:26:24,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 550 flow [2022-12-06 07:26:24,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 123 transitions, 548 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:26:24,020 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 272 flow [2022-12-06 07:26:24,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=272, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2022-12-06 07:26:24,020 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2022-12-06 07:26:24,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,021 INFO L89 Accepts]: Start accepts. Operand has 68 places, 70 transitions, 272 flow [2022-12-06 07:26:24,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 70 transitions, 272 flow [2022-12-06 07:26:24,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 70 transitions, 272 flow [2022-12-06 07:26:24,046 INFO L130 PetriNetUnfolder]: 59/393 cut-off events. [2022-12-06 07:26:24,046 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-06 07:26:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 393 events. 59/393 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2670 event pairs, 12 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 654. Up to 58 conditions per place. [2022-12-06 07:26:24,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 70 transitions, 272 flow [2022-12-06 07:26:24,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 1314 [2022-12-06 07:26:24,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [552] $Ultimate##0-->L133: Formula: (and (= v_~e3~0_30 1) (= v_~n3~0_47 (ite (< v_~n3~0_48 v_~n1~0_47) v_~n1~0_47 v_~n3~0_48))) InVars {~n3~0=v_~n3~0_48, ~n1~0=v_~n1~0_47} OutVars{~n3~0=v_~n3~0_47, ~n1~0=v_~n1~0_47, ~e3~0=v_~e3~0_30} AuxVars[] AssignedVars[~n3~0, ~e3~0] and [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-06 07:26:24,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:26:24,121 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 272 flow [2022-12-06 07:26:24,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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 07:26:24,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,122 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] [2022-12-06 07:26:24,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:26:24,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1814553414, now seen corresponding path program 1 times [2022-12-06 07:26:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060941717] [2022-12-06 07:26:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,509 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 07:26:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060941717] [2022-12-06 07:26:24,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060941717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:26:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498495291] [2022-12-06 07:26:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:26:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:26:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:26:24,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2022-12-06 07:26:24,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 07:26:24,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2022-12-06 07:26:24,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,391 INFO L130 PetriNetUnfolder]: 8070/12945 cut-off events. [2022-12-06 07:26:25,391 INFO L131 PetriNetUnfolder]: For 5479/5553 co-relation queries the response was YES. [2022-12-06 07:26:25,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31068 conditions, 12945 events. 8070/12945 cut-off events. For 5479/5553 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 81884 event pairs, 1928 based on Foata normal form. 196/12912 useless extension candidates. Maximal degree in co-relation 24674. Up to 8380 conditions per place. [2022-12-06 07:26:25,458 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 113 selfloop transitions, 21 changer transitions 0/148 dead transitions. [2022-12-06 07:26:25,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 148 transitions, 772 flow [2022-12-06 07:26:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2022-12-06 07:26:25,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2022-12-06 07:26:25,459 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 272 flow. Second operand 6 states and 158 transitions. [2022-12-06 07:26:25,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 148 transitions, 772 flow [2022-12-06 07:26:25,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 768 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 07:26:25,475 INFO L231 Difference]: Finished difference. Result has 76 places, 89 transitions, 430 flow [2022-12-06 07:26:25,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=76, PETRI_TRANSITIONS=89} [2022-12-06 07:26:25,476 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2022-12-06 07:26:25,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,477 INFO L89 Accepts]: Start accepts. Operand has 76 places, 89 transitions, 430 flow [2022-12-06 07:26:25,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 89 transitions, 430 flow [2022-12-06 07:26:25,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 89 transitions, 430 flow [2022-12-06 07:26:25,534 INFO L130 PetriNetUnfolder]: 287/1131 cut-off events. [2022-12-06 07:26:25,534 INFO L131 PetriNetUnfolder]: For 820/850 co-relation queries the response was YES. [2022-12-06 07:26:25,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 1131 events. 287/1131 cut-off events. For 820/850 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9125 event pairs, 92 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 2519. Up to 224 conditions per place. [2022-12-06 07:26:25,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 89 transitions, 430 flow [2022-12-06 07:26:25,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 1762 [2022-12-06 07:26:25,572 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:25,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:25,573 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 89 transitions, 430 flow [2022-12-06 07:26:25,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 07:26:25,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,574 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] [2022-12-06 07:26:25,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:26:25,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash 956755159, now seen corresponding path program 1 times [2022-12-06 07:26:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908789742] [2022-12-06 07:26:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,662 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 07:26:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908789742] [2022-12-06 07:26:25,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908789742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966993180] [2022-12-06 07:26:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:26:25,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:26:25,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:26:25,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2022-12-06 07:26:25,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 89 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 07:26:25,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2022-12-06 07:26:25,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,222 INFO L130 PetriNetUnfolder]: 5167/8777 cut-off events. [2022-12-06 07:26:26,222 INFO L131 PetriNetUnfolder]: For 9905/10126 co-relation queries the response was YES. [2022-12-06 07:26:26,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24921 conditions, 8777 events. 5167/8777 cut-off events. For 9905/10126 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 57298 event pairs, 3530 based on Foata normal form. 122/8675 useless extension candidates. Maximal degree in co-relation 19458. Up to 7116 conditions per place. [2022-12-06 07:26:26,256 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 88 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2022-12-06 07:26:26,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 745 flow [2022-12-06 07:26:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:26:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:26:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-06 07:26:26,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2022-12-06 07:26:26,257 INFO L175 Difference]: Start difference. First operand has 76 places, 89 transitions, 430 flow. Second operand 3 states and 88 transitions. [2022-12-06 07:26:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 745 flow [2022-12-06 07:26:26,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 723 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 07:26:26,280 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 440 flow [2022-12-06 07:26:26,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2022-12-06 07:26:26,281 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2022-12-06 07:26:26,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,281 INFO L89 Accepts]: Start accepts. Operand has 79 places, 89 transitions, 440 flow [2022-12-06 07:26:26,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 89 transitions, 440 flow [2022-12-06 07:26:26,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 89 transitions, 440 flow [2022-12-06 07:26:26,330 INFO L130 PetriNetUnfolder]: 217/941 cut-off events. [2022-12-06 07:26:26,330 INFO L131 PetriNetUnfolder]: For 826/853 co-relation queries the response was YES. [2022-12-06 07:26:26,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 941 events. 217/941 cut-off events. For 826/853 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7342 event pairs, 67 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 2228. Up to 193 conditions per place. [2022-12-06 07:26:26,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 89 transitions, 440 flow [2022-12-06 07:26:26,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 1572 [2022-12-06 07:26:26,345 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:26,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 07:26:26,349 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 440 flow [2022-12-06 07:26:26,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 07:26:26,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,350 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] [2022-12-06 07:26:26,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:26:26,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -535882418, now seen corresponding path program 2 times [2022-12-06 07:26:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445254228] [2022-12-06 07:26:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,431 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 07:26:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445254228] [2022-12-06 07:26:26,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445254228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531137077] [2022-12-06 07:26:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:26:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:26:26,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:26:26,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2022-12-06 07:26:26,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 07:26:26,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2022-12-06 07:26:26,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,947 INFO L130 PetriNetUnfolder]: 4978/8493 cut-off events. [2022-12-06 07:26:26,947 INFO L131 PetriNetUnfolder]: For 11136/11278 co-relation queries the response was YES. [2022-12-06 07:26:26,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25556 conditions, 8493 events. 4978/8493 cut-off events. For 11136/11278 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 55330 event pairs, 3416 based on Foata normal form. 112/8335 useless extension candidates. Maximal degree in co-relation 19791. Up to 6744 conditions per place. [2022-12-06 07:26:26,987 INFO L137 encePairwiseOnDemand]: 43/49 looper letters, 85 selfloop transitions, 12 changer transitions 0/117 dead transitions. [2022-12-06 07:26:26,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 782 flow [2022-12-06 07:26:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:26:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:26:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-06 07:26:26,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5850340136054422 [2022-12-06 07:26:26,988 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 440 flow. Second operand 3 states and 86 transitions. [2022-12-06 07:26:26,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 782 flow [2022-12-06 07:26:26,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:27,001 INFO L231 Difference]: Finished difference. Result has 80 places, 89 transitions, 464 flow [2022-12-06 07:26:27,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=80, PETRI_TRANSITIONS=89} [2022-12-06 07:26:27,003 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2022-12-06 07:26:27,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,004 INFO L89 Accepts]: Start accepts. Operand has 80 places, 89 transitions, 464 flow [2022-12-06 07:26:27,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 89 transitions, 464 flow [2022-12-06 07:26:27,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 89 transitions, 464 flow [2022-12-06 07:26:27,050 INFO L130 PetriNetUnfolder]: 238/996 cut-off events. [2022-12-06 07:26:27,050 INFO L131 PetriNetUnfolder]: For 921/948 co-relation queries the response was YES. [2022-12-06 07:26:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 996 events. 238/996 cut-off events. For 921/948 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7790 event pairs, 68 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 2491. Up to 200 conditions per place. [2022-12-06 07:26:27,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 89 transitions, 464 flow [2022-12-06 07:26:27,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 1502 [2022-12-06 07:26:27,061 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:27,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 07:26:27,062 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 89 transitions, 464 flow [2022-12-06 07:26:27,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 07:26:27,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,063 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] [2022-12-06 07:26:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:26:27,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1286002448, now seen corresponding path program 3 times [2022-12-06 07:26:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789752446] [2022-12-06 07:26:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,144 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 07:26:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789752446] [2022-12-06 07:26:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789752446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051230427] [2022-12-06 07:26:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:26:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:26:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:26:27,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2022-12-06 07:26:27,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 07:26:27,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2022-12-06 07:26:27,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,651 INFO L130 PetriNetUnfolder]: 4918/8488 cut-off events. [2022-12-06 07:26:27,651 INFO L131 PetriNetUnfolder]: For 12031/12193 co-relation queries the response was YES. [2022-12-06 07:26:27,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26082 conditions, 8488 events. 4918/8488 cut-off events. For 12031/12193 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 55972 event pairs, 3518 based on Foata normal form. 63/8277 useless extension candidates. Maximal degree in co-relation 20201. Up to 6922 conditions per place. [2022-12-06 07:26:27,693 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 84 selfloop transitions, 6 changer transitions 1/111 dead transitions. [2022-12-06 07:26:27,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 111 transitions, 749 flow [2022-12-06 07:26:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:26:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:26:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-06 07:26:27,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2022-12-06 07:26:27,694 INFO L175 Difference]: Start difference. First operand has 80 places, 89 transitions, 464 flow. Second operand 3 states and 89 transitions. [2022-12-06 07:26:27,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 111 transitions, 749 flow [2022-12-06 07:26:27,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:27,711 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 462 flow [2022-12-06 07:26:27,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2022-12-06 07:26:27,711 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2022-12-06 07:26:27,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,712 INFO L89 Accepts]: Start accepts. Operand has 81 places, 89 transitions, 462 flow [2022-12-06 07:26:27,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 89 transitions, 462 flow [2022-12-06 07:26:27,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 89 transitions, 462 flow [2022-12-06 07:26:27,760 INFO L130 PetriNetUnfolder]: 277/1114 cut-off events. [2022-12-06 07:26:27,760 INFO L131 PetriNetUnfolder]: For 926/955 co-relation queries the response was YES. [2022-12-06 07:26:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1114 events. 277/1114 cut-off events. For 926/955 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8747 event pairs, 83 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 2743. Up to 223 conditions per place. [2022-12-06 07:26:27,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 89 transitions, 462 flow [2022-12-06 07:26:27,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 1482 [2022-12-06 07:26:27,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:26:27,885 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 466 flow [2022-12-06 07:26:27,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 07:26:27,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,885 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] [2022-12-06 07:26:27,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:26:27,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1211970786, now seen corresponding path program 4 times [2022-12-06 07:26:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666901411] [2022-12-06 07:26:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,202 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 07:26:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666901411] [2022-12-06 07:26:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666901411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:26:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514193358] [2022-12-06 07:26:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:26:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:26:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:26:28,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-06 07:26:28,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 466 flow. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:26:28,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-06 07:26:28,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,097 INFO L130 PetriNetUnfolder]: 6702/11147 cut-off events. [2022-12-06 07:26:29,097 INFO L131 PetriNetUnfolder]: For 15498/15714 co-relation queries the response was YES. [2022-12-06 07:26:29,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35106 conditions, 11147 events. 6702/11147 cut-off events. For 15498/15714 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 72149 event pairs, 1128 based on Foata normal form. 152/11158 useless extension candidates. Maximal degree in co-relation 27784. Up to 6159 conditions per place. [2022-12-06 07:26:29,157 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 153 selfloop transitions, 40 changer transitions 0/207 dead transitions. [2022-12-06 07:26:29,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 207 transitions, 1395 flow [2022-12-06 07:26:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:26:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:26:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2022-12-06 07:26:29,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2022-12-06 07:26:29,159 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 466 flow. Second operand 10 states and 215 transitions. [2022-12-06 07:26:29,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 207 transitions, 1395 flow [2022-12-06 07:26:29,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 207 transitions, 1363 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:29,179 INFO L231 Difference]: Finished difference. Result has 95 places, 113 transitions, 758 flow [2022-12-06 07:26:29,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=758, PETRI_PLACES=95, PETRI_TRANSITIONS=113} [2022-12-06 07:26:29,179 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2022-12-06 07:26:29,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,180 INFO L89 Accepts]: Start accepts. Operand has 95 places, 113 transitions, 758 flow [2022-12-06 07:26:29,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 113 transitions, 758 flow [2022-12-06 07:26:29,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 113 transitions, 758 flow [2022-12-06 07:26:29,275 INFO L130 PetriNetUnfolder]: 356/1456 cut-off events. [2022-12-06 07:26:29,275 INFO L131 PetriNetUnfolder]: For 2692/2756 co-relation queries the response was YES. [2022-12-06 07:26:29,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 1456 events. 356/1456 cut-off events. For 2692/2756 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 12450 event pairs, 97 based on Foata normal form. 2/1376 useless extension candidates. Maximal degree in co-relation 4224. Up to 304 conditions per place. [2022-12-06 07:26:29,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 113 transitions, 758 flow [2022-12-06 07:26:29,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 1730 [2022-12-06 07:26:29,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] and [656] L133-->L142: Formula: (and (= (+ (ite (< v_~n3~0_485 v_~n2~0_505) v_~n2~0_505 v_~n3~0_485) 1) v_~n3~0_483) (= v_~e3~0_207 0)) InVars {~n2~0=v_~n2~0_505, ~n3~0=v_~n3~0_485} OutVars{~n2~0=v_~n2~0_505, ~n3~0=v_~n3~0_483, ~e3~0=v_~e3~0_207, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_33|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] [2022-12-06 07:26:29,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] and [528] L133-->L136: Formula: (= (ite (< v_~n3~0_11 v_~n2~0_13) v_~n2~0_13 v_~n3~0_11) v_~n3~0_10) InVars {~n2~0=v_~n2~0_13, ~n3~0=v_~n3~0_11} OutVars{~n2~0=v_~n2~0_13, ~n3~0=v_~n3~0_10} AuxVars[] AssignedVars[~n3~0] [2022-12-06 07:26:29,392 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:26:29,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 07:26:29,393 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 114 transitions, 796 flow [2022-12-06 07:26:29,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:26:29,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,393 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] [2022-12-06 07:26:29,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:26:29,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 907845470, now seen corresponding path program 1 times [2022-12-06 07:26:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619194918] [2022-12-06 07:26:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,683 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 07:26:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619194918] [2022-12-06 07:26:29,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619194918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:26:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752612345] [2022-12-06 07:26:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:26:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:26:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:26:29,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2022-12-06 07:26:29,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 114 transitions, 796 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2022-12-06 07:26:29,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,980 INFO L130 PetriNetUnfolder]: 10189/17550 cut-off events. [2022-12-06 07:26:30,980 INFO L131 PetriNetUnfolder]: For 40981/41346 co-relation queries the response was YES. [2022-12-06 07:26:31,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59927 conditions, 17550 events. 10189/17550 cut-off events. For 40981/41346 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 127155 event pairs, 3239 based on Foata normal form. 204/17536 useless extension candidates. Maximal degree in co-relation 46694. Up to 6261 conditions per place. [2022-12-06 07:26:31,076 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 217 selfloop transitions, 39 changer transitions 1/271 dead transitions. [2022-12-06 07:26:31,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 271 transitions, 2171 flow [2022-12-06 07:26:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:26:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:26:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2022-12-06 07:26:31,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2022-12-06 07:26:31,077 INFO L175 Difference]: Start difference. First operand has 96 places, 114 transitions, 796 flow. Second operand 8 states and 236 transitions. [2022-12-06 07:26:31,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 271 transitions, 2171 flow [2022-12-06 07:26:31,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 271 transitions, 2083 flow, removed 44 selfloop flow, removed 0 redundant places. [2022-12-06 07:26:31,173 INFO L231 Difference]: Finished difference. Result has 109 places, 135 transitions, 1067 flow [2022-12-06 07:26:31,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1067, PETRI_PLACES=109, PETRI_TRANSITIONS=135} [2022-12-06 07:26:31,174 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 56 predicate places. [2022-12-06 07:26:31,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,174 INFO L89 Accepts]: Start accepts. Operand has 109 places, 135 transitions, 1067 flow [2022-12-06 07:26:31,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 135 transitions, 1067 flow [2022-12-06 07:26:31,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 135 transitions, 1067 flow [2022-12-06 07:26:31,363 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L106-->L109: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (= (mod v_~e3~0_16 256) 0) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|))) InVars {~e3~0=v_~e3~0_16} OutVars{~e3~0=v_~e3~0_16, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][42], [Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 42#L190-4true, 220#true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), 158#(= ~i~0 0), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), 183#true, 124#L142true, Black: 210#(= ~e1~0 1), Black: 214#(= ~e3~0 1), Black: 218#(= ~e2~0 1), 23#L109true, Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 227#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), 70#L66true, Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 222#(= ~n3~0 0), Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 228#(and (not (= ~n1~0 0)) (<= (+ ~n1~0 1) ~n3~0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 241#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 243#(<= 1 ~n2~0), Black: 242#(= ~n2~0 0), 198#true, Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), 238#true]) [2022-12-06 07:26:31,363 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 07:26:31,363 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:26:31,364 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:26:31,364 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:26:31,435 INFO L130 PetriNetUnfolder]: 557/2287 cut-off events. [2022-12-06 07:26:31,435 INFO L131 PetriNetUnfolder]: For 6807/6925 co-relation queries the response was YES. [2022-12-06 07:26:31,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 2287 events. 557/2287 cut-off events. For 6807/6925 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21640 event pairs, 135 based on Foata normal form. 9/2163 useless extension candidates. Maximal degree in co-relation 7436. Up to 468 conditions per place. [2022-12-06 07:26:31,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 135 transitions, 1067 flow [2022-12-06 07:26:31,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 1980 [2022-12-06 07:26:31,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [658] L93-->L136: Formula: (and (= v_~n2~0_529 (+ v_~n2~0_530 1)) (= v_~e2~0_201 0) (= (ite (< v_~n3~0_518 v_~n2~0_529) v_~n2~0_529 v_~n3~0_518) v_~n3~0_517)) InVars {~n2~0=v_~n2~0_530, ~n3~0=v_~n3~0_518} OutVars{~n2~0=v_~n2~0_529, ~n3~0=v_~n3~0_517, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_38|, ~e2~0=v_~e2~0_201} AuxVars[] AssignedVars[~n2~0, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] and [517] L99-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_16 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~e1~0=v_~e1~0_16} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-06 07:26:31,761 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:26:31,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 589 [2022-12-06 07:26:31,763 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 138 transitions, 1108 flow [2022-12-06 07:26:31,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:31,763 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] [2022-12-06 07:26:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:26:31,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash 844700725, now seen corresponding path program 2 times [2022-12-06 07:26:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11734562] [2022-12-06 07:26:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,292 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 07:26:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11734562] [2022-12-06 07:26:32,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11734562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:26:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290220689] [2022-12-06 07:26:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:26:32,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:26:32,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:26:32,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2022-12-06 07:26:32,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 138 transitions, 1108 flow. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:26:32,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2022-12-06 07:26:32,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,809 INFO L130 PetriNetUnfolder]: 21927/38058 cut-off events. [2022-12-06 07:26:36,809 INFO L131 PetriNetUnfolder]: For 126339/127382 co-relation queries the response was YES. [2022-12-06 07:26:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139084 conditions, 38058 events. 21927/38058 cut-off events. For 126339/127382 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 318702 event pairs, 5096 based on Foata normal form. 588/38195 useless extension candidates. Maximal degree in co-relation 102276. Up to 9127 conditions per place. [2022-12-06 07:26:37,055 INFO L137 encePairwiseOnDemand]: 34/60 looper letters, 380 selfloop transitions, 176 changer transitions 7/577 dead transitions. [2022-12-06 07:26:37,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 577 transitions, 4893 flow [2022-12-06 07:26:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:26:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:26:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 553 transitions. [2022-12-06 07:26:37,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4850877192982456 [2022-12-06 07:26:37,057 INFO L175 Difference]: Start difference. First operand has 109 places, 138 transitions, 1108 flow. Second operand 19 states and 553 transitions. [2022-12-06 07:26:37,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 577 transitions, 4893 flow [2022-12-06 07:26:37,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 577 transitions, 4781 flow, removed 56 selfloop flow, removed 0 redundant places. [2022-12-06 07:26:37,486 INFO L231 Difference]: Finished difference. Result has 145 places, 296 transitions, 3227 flow [2022-12-06 07:26:37,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3227, PETRI_PLACES=145, PETRI_TRANSITIONS=296} [2022-12-06 07:26:37,486 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2022-12-06 07:26:37,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,486 INFO L89 Accepts]: Start accepts. Operand has 145 places, 296 transitions, 3227 flow [2022-12-06 07:26:37,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 296 transitions, 3227 flow [2022-12-06 07:26:37,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 296 transitions, 3227 flow [2022-12-06 07:26:38,032 INFO L130 PetriNetUnfolder]: 1628/5766 cut-off events. [2022-12-06 07:26:38,032 INFO L131 PetriNetUnfolder]: For 37129/37996 co-relation queries the response was YES. [2022-12-06 07:26:38,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24360 conditions, 5766 events. 1628/5766 cut-off events. For 37129/37996 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 62636 event pairs, 359 based on Foata normal form. 88/5568 useless extension candidates. Maximal degree in co-relation 23641. Up to 1237 conditions per place. [2022-12-06 07:26:38,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 296 transitions, 3227 flow [2022-12-06 07:26:38,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 4232 [2022-12-06 07:26:38,383 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L93-->L103: Formula: (and (= (ite (= (mod v_~e1~0_186 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_95| 0)) (= v_~n2~0_547 (+ v_~n2~0_548 1)) (= v_~e2~0_209 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_95|)) InVars {~n2~0=v_~n2~0_548, ~e1~0=v_~e1~0_186} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_95|, ~n2~0=v_~n2~0_547, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_44|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|, ~e2~0=v_~e2~0_209, ~e1~0=v_~e1~0_186} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-06 07:26:38,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L47: Formula: (and (= (ite (< v_~n1~0_56 v_~n2~0_51) v_~n2~0_51 v_~n1~0_56) v_~n1~0_55) (= v_~e1~0_30 1)) InVars {~n2~0=v_~n2~0_51, ~n1~0=v_~n1~0_56} OutVars{~n2~0=v_~n2~0_51, ~n1~0=v_~n1~0_55, ~e1~0=v_~e1~0_30} AuxVars[] AssignedVars[~n1~0, ~e1~0] and [532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-06 07:26:38,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L47: Formula: (and (= (ite (< v_~n1~0_56 v_~n2~0_51) v_~n2~0_51 v_~n1~0_56) v_~n1~0_55) (= v_~e1~0_30 1)) InVars {~n2~0=v_~n2~0_51, ~n1~0=v_~n1~0_56} OutVars{~n2~0=v_~n2~0_51, ~n1~0=v_~n1~0_55, ~e1~0=v_~e1~0_30} AuxVars[] AssignedVars[~n1~0, ~e1~0] and [633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] [2022-12-06 07:26:38,663 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L136: Formula: (and (= (let ((.cse0 (ite (< v_~n3~0_357 v_~n1~0_446) v_~n1~0_446 v_~n3~0_357))) (ite (< .cse0 v_~n2~0_410) v_~n2~0_410 .cse0)) v_~n3~0_355) (= v_~e3~0_172 1)) InVars {~n2~0=v_~n2~0_410, ~n3~0=v_~n3~0_357, ~n1~0=v_~n1~0_446} OutVars{~n2~0=v_~n2~0_410, ~n3~0=v_~n3~0_355, ~n1~0=v_~n1~0_446, ~e3~0=v_~e3~0_172} AuxVars[] AssignedVars[~n3~0, ~e3~0] and [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-06 07:26:39,004 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:26:39,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1524 [2022-12-06 07:26:39,010 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 298 transitions, 3316 flow [2022-12-06 07:26:39,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:26:39,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,010 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] [2022-12-06 07:26:39,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:26:39,010 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:39,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2021523985, now seen corresponding path program 1 times [2022-12-06 07:26:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671607626] [2022-12-06 07:26:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,358 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 07:26:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671607626] [2022-12-06 07:26:39,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671607626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:26:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818236901] [2022-12-06 07:26:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:26:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:26:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:26:39,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 75 [2022-12-06 07:26:39,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 298 transitions, 3316 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 07:26:39,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 75 [2022-12-06 07:26:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,526 INFO L130 PetriNetUnfolder]: 23238/39535 cut-off events. [2022-12-06 07:26:44,526 INFO L131 PetriNetUnfolder]: For 271383/274400 co-relation queries the response was YES. [2022-12-06 07:26:44,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174784 conditions, 39535 events. 23238/39535 cut-off events. For 271383/274400 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 323725 event pairs, 9288 based on Foata normal form. 804/39652 useless extension candidates. Maximal degree in co-relation 134716. Up to 29174 conditions per place. [2022-12-06 07:26:44,856 INFO L137 encePairwiseOnDemand]: 61/75 looper letters, 364 selfloop transitions, 73 changer transitions 11/462 dead transitions. [2022-12-06 07:26:44,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 462 transitions, 5894 flow [2022-12-06 07:26:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2022-12-06 07:26:44,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42444444444444446 [2022-12-06 07:26:44,857 INFO L175 Difference]: Start difference. First operand has 146 places, 298 transitions, 3316 flow. Second operand 6 states and 191 transitions. [2022-12-06 07:26:44,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 462 transitions, 5894 flow [2022-12-06 07:26:47,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 462 transitions, 5448 flow, removed 223 selfloop flow, removed 1 redundant places. [2022-12-06 07:26:47,877 INFO L231 Difference]: Finished difference. Result has 154 places, 339 transitions, 3808 flow [2022-12-06 07:26:47,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2980, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3808, PETRI_PLACES=154, PETRI_TRANSITIONS=339} [2022-12-06 07:26:47,878 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 101 predicate places. [2022-12-06 07:26:47,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,878 INFO L89 Accepts]: Start accepts. Operand has 154 places, 339 transitions, 3808 flow [2022-12-06 07:26:47,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 339 transitions, 3808 flow [2022-12-06 07:26:47,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 339 transitions, 3808 flow [2022-12-06 07:26:48,407 INFO L130 PetriNetUnfolder]: 1755/6234 cut-off events. [2022-12-06 07:26:48,408 INFO L131 PetriNetUnfolder]: For 41609/42610 co-relation queries the response was YES. [2022-12-06 07:26:48,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26557 conditions, 6234 events. 1755/6234 cut-off events. For 41609/42610 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 68963 event pairs, 363 based on Foata normal form. 99/5999 useless extension candidates. Maximal degree in co-relation 25799. Up to 1197 conditions per place. [2022-12-06 07:26:48,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 339 transitions, 3808 flow [2022-12-06 07:26:48,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 4430 [2022-12-06 07:26:48,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L93-->L103: Formula: (and (= (+ v_~n2~0_544 1) v_~n2~0_543) (= v_~e2~0_207 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| 0)) (= (ite (< v_~n3~0_535 v_~n2~0_543) v_~n2~0_543 v_~n3~0_535) v_~n3~0_534) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93| (ite (= (mod v_~e1~0_184 256) 0) 1 0))) InVars {~n2~0=v_~n2~0_544, ~n3~0=v_~n3~0_535, ~e1~0=v_~e1~0_184} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, ~n2~0=v_~n2~0_543, ~n3~0=v_~n3~0_534, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_42|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|, ~e2~0=v_~e2~0_207, ~e1~0=v_~e1~0_184} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-06 07:26:49,005 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:26:49,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1128 [2022-12-06 07:26:49,006 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 341 transitions, 3856 flow [2022-12-06 07:26:49,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 07:26:49,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,007 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] [2022-12-06 07:26:49,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:26:49,007 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1726313178, now seen corresponding path program 1 times [2022-12-06 07:26:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562112287] [2022-12-06 07:26:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,282 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 07:26:49,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562112287] [2022-12-06 07:26:49,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562112287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:26:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547490258] [2022-12-06 07:26:49,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:26:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:26:49,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:26:49,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 78 [2022-12-06 07:26:49,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 341 transitions, 3856 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 07:26:49,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 78 [2022-12-06 07:26:49,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,140 INFO L130 PetriNetUnfolder]: 20860/36126 cut-off events. [2022-12-06 07:26:54,140 INFO L131 PetriNetUnfolder]: For 241470/243888 co-relation queries the response was YES. [2022-12-06 07:26:54,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159101 conditions, 36126 events. 20860/36126 cut-off events. For 241470/243888 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 297916 event pairs, 7622 based on Foata normal form. 778/36462 useless extension candidates. Maximal degree in co-relation 153710. Up to 26626 conditions per place. [2022-12-06 07:26:54,454 INFO L137 encePairwiseOnDemand]: 57/78 looper letters, 348 selfloop transitions, 67 changer transitions 4/433 dead transitions. [2022-12-06 07:26:54,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 433 transitions, 5478 flow [2022-12-06 07:26:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2022-12-06 07:26:54,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2022-12-06 07:26:54,474 INFO L175 Difference]: Start difference. First operand has 151 places, 341 transitions, 3856 flow. Second operand 6 states and 188 transitions. [2022-12-06 07:26:54,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 433 transitions, 5478 flow [2022-12-06 07:26:55,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 433 transitions, 5401 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:55,963 INFO L231 Difference]: Finished difference. Result has 158 places, 339 transitions, 4083 flow [2022-12-06 07:26:55,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=3574, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4083, PETRI_PLACES=158, PETRI_TRANSITIONS=339} [2022-12-06 07:26:55,980 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 105 predicate places. [2022-12-06 07:26:55,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,980 INFO L89 Accepts]: Start accepts. Operand has 158 places, 339 transitions, 4083 flow [2022-12-06 07:26:55,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 339 transitions, 4083 flow [2022-12-06 07:26:55,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 339 transitions, 4083 flow [2022-12-06 07:26:56,422 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= v_~n3~0_125 0)) InVars {} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~n3~0=v_~n3~0_125, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~n3~0, thread3Thread1of1ForFork0_#res#1.base][184], [315#true, Black: 278#(and (or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 262#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 276#(and (or (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))) (= ~n1~0 ~n3~0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 274#(and (or (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0)) (= ~n1~0 0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), 222#(= ~n3~0 0), Black: 259#(or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)))) (<= (+ ~n1~0 1) ~n3~0))), Black: 266#(and (<= ~n1~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 260#(or (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)) (<= ~n1~0 ~n2~0))) (= ~n1~0 0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 (+ ~n2~0 1)))), Black: 253#true, Black: 268#(and (or (<= 1 ~n1~0) (<= ~n2~0 ~n3~0)) (or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))))), Black: 257#(or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), Black: 280#(and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n3~0 0)), Black: 272#(and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 (+ ~n2~0 1)) (or (<= (+ 2 ~n1~0) ~n2~0) (= ~n1~0 0))), Black: 264#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 270#(and (or (and (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (< ~n3~0 (+ ~n2~0 1))), Black: 256#(and (<= ~n3~0 ~n2~0) (= ~n3~0 0)), Black: 261#(or (and (or (and (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 258#(or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 308#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 158#(= ~i~0 0), 241#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 307#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n1~0 1)), 303#true, Black: 306#(and (<= 0 ~n1~0) (= ~n2~0 0) (<= ~n1~0 0)), Black: 305#(and (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0)), 198#true, 11#thread2EXITtrue, Black: 319#(and (<= 1 ~n1~0) (<= ~n1~0 1) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 317#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 42#L190-4true, Black: 320#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 318#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), 183#true, Black: 210#(= ~e1~0 1), 156#true, Black: 214#(= ~e3~0 1), 22#L56true, 19#thread3EXITtrue, Black: 218#(= ~e2~0 1), Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 255#(= ~n3~0 0), Black: 243#(<= 1 ~n2~0), Black: 242#(= ~n2~0 0), Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0))]) [2022-12-06 07:26:56,423 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-12-06 07:26:56,423 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-12-06 07:26:56,426 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2022-12-06 07:26:56,426 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-12-06 07:26:56,582 INFO L130 PetriNetUnfolder]: 1547/5637 cut-off events. [2022-12-06 07:26:56,582 INFO L131 PetriNetUnfolder]: For 38177/38956 co-relation queries the response was YES. [2022-12-06 07:26:56,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24379 conditions, 5637 events. 1547/5637 cut-off events. For 38177/38956 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 61434 event pairs, 333 based on Foata normal form. 98/5436 useless extension candidates. Maximal degree in co-relation 23719. Up to 1139 conditions per place. [2022-12-06 07:26:56,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 339 transitions, 4083 flow [2022-12-06 07:26:56,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 4180 [2022-12-06 07:26:56,711 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:56,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 732 [2022-12-06 07:26:56,712 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 339 transitions, 4083 flow [2022-12-06 07:26:56,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 07:26:56,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,713 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] [2022-12-06 07:26:56,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:26:56,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2144504049, now seen corresponding path program 1 times [2022-12-06 07:26:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497315068] [2022-12-06 07:26:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,995 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 07:26:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497315068] [2022-12-06 07:26:56,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497315068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:26:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089018700] [2022-12-06 07:26:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:26:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:26:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:26:56,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 76 [2022-12-06 07:26:56,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 339 transitions, 4083 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:26:56,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 76 [2022-12-06 07:26:56,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,632 INFO L130 PetriNetUnfolder]: 20443/35127 cut-off events. [2022-12-06 07:27:01,632 INFO L131 PetriNetUnfolder]: For 233590/236178 co-relation queries the response was YES. [2022-12-06 07:27:01,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156560 conditions, 35127 events. 20443/35127 cut-off events. For 233590/236178 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 285586 event pairs, 9306 based on Foata normal form. 150/34649 useless extension candidates. Maximal degree in co-relation 151212. Up to 31878 conditions per place. [2022-12-06 07:27:01,966 INFO L137 encePairwiseOnDemand]: 63/76 looper letters, 354 selfloop transitions, 35 changer transitions 0/403 dead transitions. [2022-12-06 07:27:01,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 403 transitions, 5390 flow [2022-12-06 07:27:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:27:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:27:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-12-06 07:27:01,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33270676691729323 [2022-12-06 07:27:01,968 INFO L175 Difference]: Start difference. First operand has 156 places, 339 transitions, 4083 flow. Second operand 7 states and 177 transitions. [2022-12-06 07:27:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 403 transitions, 5390 flow [2022-12-06 07:27:03,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 403 transitions, 5340 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 07:27:03,441 INFO L231 Difference]: Finished difference. Result has 165 places, 357 transitions, 4360 flow [2022-12-06 07:27:03,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=4024, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4360, PETRI_PLACES=165, PETRI_TRANSITIONS=357} [2022-12-06 07:27:03,442 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 112 predicate places. [2022-12-06 07:27:03,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,442 INFO L89 Accepts]: Start accepts. Operand has 165 places, 357 transitions, 4360 flow [2022-12-06 07:27:03,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 357 transitions, 4360 flow [2022-12-06 07:27:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 357 transitions, 4360 flow [2022-12-06 07:27:03,871 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= v_~n3~0_125 0)) InVars {} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~n3~0=v_~n3~0_125, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~n3~0, thread3Thread1of1ForFork0_#res#1.base][194], [Black: 278#(and (or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 262#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 276#(and (or (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))) (= ~n1~0 ~n3~0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 274#(and (or (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0)) (= ~n1~0 0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 259#(or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)))) (<= (+ ~n1~0 1) ~n3~0))), 222#(= ~n3~0 0), Black: 266#(and (<= ~n1~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 260#(or (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)) (<= ~n1~0 ~n2~0))) (= ~n1~0 0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 (+ ~n2~0 1)))), Black: 253#true, Black: 268#(and (or (<= 1 ~n1~0) (<= ~n2~0 ~n3~0)) (or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))))), Black: 257#(or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), Black: 280#(and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n3~0 0)), Black: 272#(and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 (+ ~n2~0 1)) (or (<= (+ 2 ~n1~0) ~n2~0) (= ~n1~0 0))), Black: 264#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 270#(and (or (and (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (< ~n3~0 (+ ~n2~0 1))), Black: 256#(and (<= ~n3~0 ~n2~0) (= ~n3~0 0)), Black: 261#(or (and (or (and (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 258#(or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))), 325#true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 308#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 158#(= ~i~0 0), Black: 307#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n1~0 1)), 241#(and (= ~n2~0 0) (= ~n3~0 0)), 303#true, Black: 306#(and (<= 0 ~n1~0) (= ~n2~0 0) (<= ~n1~0 0)), Black: 305#(and (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0)), 11#thread2EXITtrue, 198#true, Black: 319#(and (<= 1 ~n1~0) (<= ~n1~0 1) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 317#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 42#L190-4true, Black: 320#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 318#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 334#(and (<= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), Black: 332#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 328#(and (<= ~n2~0 ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), 183#true, Black: 331#(and (<= 1 ~n3~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 210#(= ~e1~0 1), 156#true, Black: 214#(= ~e3~0 1), 22#L56true, Black: 218#(= ~e2~0 1), 19#thread3EXITtrue, Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 255#(= ~n3~0 0), Black: 243#(<= 1 ~n2~0), Black: 242#(= ~n2~0 0), Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0))]) [2022-12-06 07:27:03,872 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-12-06 07:27:03,872 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-12-06 07:27:03,872 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2022-12-06 07:27:03,872 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-12-06 07:27:04,017 INFO L130 PetriNetUnfolder]: 1493/5497 cut-off events. [2022-12-06 07:27:04,017 INFO L131 PetriNetUnfolder]: For 38462/39298 co-relation queries the response was YES. [2022-12-06 07:27:04,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24116 conditions, 5497 events. 1493/5497 cut-off events. For 38462/39298 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 59732 event pairs, 334 based on Foata normal form. 108/5308 useless extension candidates. Maximal degree in co-relation 23457. Up to 1100 conditions per place. [2022-12-06 07:27:04,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 357 transitions, 4360 flow [2022-12-06 07:27:04,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 4152 [2022-12-06 07:27:04,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] and [500] L47-->L50: Formula: (= v_~n1~0_3 (ite (< v_~n1~0_4 v_~n3~0_1) v_~n3~0_1 v_~n1~0_4)) InVars {~n3~0=v_~n3~0_1, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_1, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] [2022-12-06 07:27:04,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] and [586] L50-->L56: Formula: (and (= v_~e1~0_57 0) (= v_~n1~0_100 (+ v_~n1~0_101 1))) InVars {~n1~0=v_~n1~0_101} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_7|, ~n1~0=v_~n1~0_100, ~e1~0=v_~e1~0_57} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~n1~0, ~e1~0] [2022-12-06 07:27:04,259 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:27:04,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 818 [2022-12-06 07:27:04,260 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 357 transitions, 4390 flow [2022-12-06 07:27:04,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:27:04,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,260 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] [2022-12-06 07:27:04,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:27:04,261 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash -6083789, now seen corresponding path program 2 times [2022-12-06 07:27:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834470552] [2022-12-06 07:27:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,547 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 07:27:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834470552] [2022-12-06 07:27:04,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834470552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:27:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536955527] [2022-12-06 07:27:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:27:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:27:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:27:04,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 79 [2022-12-06 07:27:04,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 357 transitions, 4390 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 07:27:04,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 79 [2022-12-06 07:27:04,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,494 INFO L130 PetriNetUnfolder]: 20429/35115 cut-off events. [2022-12-06 07:27:09,495 INFO L131 PetriNetUnfolder]: For 239223/241862 co-relation queries the response was YES. [2022-12-06 07:27:09,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158327 conditions, 35115 events. 20429/35115 cut-off events. For 239223/241862 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 285849 event pairs, 9338 based on Foata normal form. 190/34700 useless extension candidates. Maximal degree in co-relation 152977. Up to 31750 conditions per place. [2022-12-06 07:27:09,837 INFO L137 encePairwiseOnDemand]: 66/79 looper letters, 357 selfloop transitions, 29 changer transitions 0/400 dead transitions. [2022-12-06 07:27:09,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 400 transitions, 5494 flow [2022-12-06 07:27:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:27:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:27:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2022-12-06 07:27:09,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31645569620253167 [2022-12-06 07:27:09,839 INFO L175 Difference]: Start difference. First operand has 165 places, 357 transitions, 4390 flow. Second operand 7 states and 175 transitions. [2022-12-06 07:27:09,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 400 transitions, 5494 flow [2022-12-06 07:27:11,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 400 transitions, 5451 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:27:11,624 INFO L231 Difference]: Finished difference. Result has 171 places, 359 transitions, 4439 flow [2022-12-06 07:27:11,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=4336, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4439, PETRI_PLACES=171, PETRI_TRANSITIONS=359} [2022-12-06 07:27:11,625 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 118 predicate places. [2022-12-06 07:27:11,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,625 INFO L89 Accepts]: Start accepts. Operand has 171 places, 359 transitions, 4439 flow [2022-12-06 07:27:11,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 359 transitions, 4439 flow [2022-12-06 07:27:11,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 359 transitions, 4439 flow [2022-12-06 07:27:11,934 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][54], [118#L149true, 54#thread1EXITtrue, Black: 278#(and (or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 262#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 276#(and (or (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))) (= ~n1~0 ~n3~0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 274#(and (or (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0)) (= ~n1~0 0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 259#(or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)))) (<= (+ ~n1~0 1) ~n3~0))), Black: 266#(and (<= ~n1~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 260#(or (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)) (<= ~n1~0 ~n2~0))) (= ~n1~0 0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 (+ ~n2~0 1)))), Black: 268#(and (or (<= 1 ~n1~0) (<= ~n2~0 ~n3~0)) (or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))))), Black: 255#(= ~n3~0 0), Black: 257#(or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), Black: 280#(and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n3~0 0)), Black: 272#(and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 (+ ~n2~0 1)) (or (<= (+ 2 ~n1~0) ~n2~0) (= ~n1~0 0))), Black: 264#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 270#(and (or (and (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (< ~n3~0 (+ ~n2~0 1))), Black: 256#(and (<= ~n3~0 ~n2~0) (= ~n3~0 0)), 6#L106true, Black: 261#(or (and (or (and (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 258#(or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))), 253#true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), Black: 308#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 307#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n1~0 1)), 303#true, Black: 306#(and (<= 0 ~n1~0) (= ~n2~0 0) (<= ~n1~0 0)), Black: 305#(and (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0)), 198#true, Black: 319#(and (<= 1 ~n1~0) (<= ~n1~0 1) (= ~n3~0 0)), Black: 317#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 42#L190-4true, 220#true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 320#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 318#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 334#(and (<= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 332#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), 183#true, Black: 328#(and (<= ~n2~0 ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), Black: 331#(and (<= 1 ~n3~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 210#(= ~e1~0 1), 156#true, Black: 214#(= ~e3~0 1), Black: 345#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0))), Black: 218#(= ~e2~0 1), Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 222#(= ~n3~0 0), 339#true, Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 241#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 243#(<= 1 ~n2~0), Black: 242#(= ~n2~0 0), Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))]) [2022-12-06 07:27:11,934 INFO L382 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-06 07:27:11,934 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 07:27:11,934 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:27:11,934 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:27:12,135 INFO L130 PetriNetUnfolder]: 1490/5531 cut-off events. [2022-12-06 07:27:12,135 INFO L131 PetriNetUnfolder]: For 41377/42295 co-relation queries the response was YES. [2022-12-06 07:27:12,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24573 conditions, 5531 events. 1490/5531 cut-off events. For 41377/42295 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 60379 event pairs, 330 based on Foata normal form. 107/5319 useless extension candidates. Maximal degree in co-relation 23886. Up to 1110 conditions per place. [2022-12-06 07:27:12,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 359 transitions, 4439 flow [2022-12-06 07:27:12,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 4192 [2022-12-06 07:27:12,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] and [692] L93-->L56: Formula: (and (= v_~n2~0_829 (+ v_~n2~0_830 1)) (= v_~e1~0_268 0) (= v_~e2~0_303 0) (= (+ v_~n1~0_807 1) v_~n1~0_806)) InVars {~n2~0=v_~n2~0_830, ~n1~0=v_~n1~0_807} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_60|, ~n2~0=v_~n2~0_829, ~n1~0=v_~n1~0_806, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_108|, ~e2~0=v_~e2~0_303, ~e1~0=v_~e1~0_268} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0, ~e1~0] [2022-12-06 07:27:12,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] and [691] L93-->L50: Formula: (and (= (+ v_~n2~0_826 1) v_~n2~0_825) (= v_~n1~0_802 (ite (< v_~n1~0_803 v_~n3~0_741) v_~n3~0_741 v_~n1~0_803)) (= v_~e2~0_301 0)) InVars {~n2~0=v_~n2~0_826, ~n3~0=v_~n3~0_741, ~n1~0=v_~n1~0_803} OutVars{~n2~0=v_~n2~0_825, ~n3~0=v_~n3~0_741, ~n1~0=v_~n1~0_802, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_106|, ~e2~0=v_~e2~0_301} AuxVars[] AssignedVars[~n2~0, ~n1~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-06 07:27:12,360 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:27:12,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 735 [2022-12-06 07:27:12,360 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 360 transitions, 4480 flow [2022-12-06 07:27:12,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 07:27:12,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,361 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] [2022-12-06 07:27:12,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:27:12,361 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash 935652179, now seen corresponding path program 3 times [2022-12-06 07:27:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56098812] [2022-12-06 07:27:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,555 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 07:27:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56098812] [2022-12-06 07:27:12,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56098812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:27:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071861985] [2022-12-06 07:27:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:27:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:27:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:27:12,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 79 [2022-12-06 07:27:12,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 360 transitions, 4480 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:27:12,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 79 [2022-12-06 07:27:12,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,656 INFO L130 PetriNetUnfolder]: 21304/36379 cut-off events. [2022-12-06 07:27:17,656 INFO L131 PetriNetUnfolder]: For 268785/271020 co-relation queries the response was YES. [2022-12-06 07:27:17,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167366 conditions, 36379 events. 21304/36379 cut-off events. For 268785/271020 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 295296 event pairs, 9022 based on Foata normal form. 294/36119 useless extension candidates. Maximal degree in co-relation 161939. Up to 31473 conditions per place. [2022-12-06 07:27:18,166 INFO L137 encePairwiseOnDemand]: 57/79 looper letters, 383 selfloop transitions, 58 changer transitions 2/457 dead transitions. [2022-12-06 07:27:18,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 457 transitions, 6142 flow [2022-12-06 07:27:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:27:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:27:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2022-12-06 07:27:18,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3528481012658228 [2022-12-06 07:27:18,167 INFO L175 Difference]: Start difference. First operand has 172 places, 360 transitions, 4480 flow. Second operand 8 states and 223 transitions. [2022-12-06 07:27:18,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 457 transitions, 6142 flow [2022-12-06 07:27:20,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 457 transitions, 6073 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 07:27:20,187 INFO L231 Difference]: Finished difference. Result has 179 places, 376 transitions, 4853 flow [2022-12-06 07:27:20,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=4399, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4853, PETRI_PLACES=179, PETRI_TRANSITIONS=376} [2022-12-06 07:27:20,187 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 126 predicate places. [2022-12-06 07:27:20,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,187 INFO L89 Accepts]: Start accepts. Operand has 179 places, 376 transitions, 4853 flow [2022-12-06 07:27:20,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 376 transitions, 4853 flow [2022-12-06 07:27:20,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 376 transitions, 4853 flow [2022-12-06 07:27:20,561 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][56], [118#L149true, 54#thread1EXITtrue, Black: 278#(and (or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 262#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 276#(and (or (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))) (= ~n1~0 ~n3~0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 274#(and (or (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0)) (= ~n1~0 0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 259#(or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)))) (<= (+ ~n1~0 1) ~n3~0))), Black: 266#(and (<= ~n1~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 260#(or (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)) (<= ~n1~0 ~n2~0))) (= ~n1~0 0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 (+ ~n2~0 1)))), Black: 268#(and (or (<= 1 ~n1~0) (<= ~n2~0 ~n3~0)) (or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))))), Black: 255#(= ~n3~0 0), Black: 257#(or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), Black: 280#(and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n3~0 0)), Black: 272#(and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 (+ ~n2~0 1)) (or (<= (+ 2 ~n1~0) ~n2~0) (= ~n1~0 0))), Black: 264#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 270#(and (or (and (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (< ~n3~0 (+ ~n2~0 1))), Black: 256#(and (<= ~n3~0 ~n2~0) (= ~n3~0 0)), Black: 261#(or (and (or (and (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), 6#L106true, Black: 258#(or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))), 253#true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 308#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 158#(= ~i~0 0), Black: 307#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n1~0 1)), 303#true, Black: 306#(and (<= 0 ~n1~0) (= ~n2~0 0) (<= ~n1~0 0)), Black: 305#(and (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0)), 198#true, Black: 319#(and (<= 1 ~n1~0) (<= ~n1~0 1) (= ~n3~0 0)), Black: 317#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 42#L190-4true, Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 220#true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 320#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 318#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), 348#true, Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 334#(and (<= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 332#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 328#(and (<= ~n2~0 ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), 183#true, Black: 331#(and (<= 1 ~n3~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 210#(= ~e1~0 1), 156#true, Black: 214#(= ~e3~0 1), Black: 345#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0))), Black: 218#(= ~e2~0 1), Black: 350#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 351#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 354#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 352#(and (<= 1 ~n3~0) (= ~n1~0 0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), Black: 355#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 222#(= ~n3~0 0), Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 241#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 243#(<= 1 ~n2~0), Black: 242#(= ~n2~0 0), Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))]) [2022-12-06 07:27:20,561 INFO L382 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-06 07:27:20,561 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 07:27:20,561 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:27:20,561 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:27:20,767 INFO L130 PetriNetUnfolder]: 1488/5642 cut-off events. [2022-12-06 07:27:20,767 INFO L131 PetriNetUnfolder]: For 47027/47964 co-relation queries the response was YES. [2022-12-06 07:27:20,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26109 conditions, 5642 events. 1488/5642 cut-off events. For 47027/47964 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 62476 event pairs, 344 based on Foata normal form. 117/5433 useless extension candidates. Maximal degree in co-relation 25381. Up to 1113 conditions per place. [2022-12-06 07:27:20,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 376 transitions, 4853 flow [2022-12-06 07:27:20,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 4254 [2022-12-06 07:27:20,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 752 [2022-12-06 07:27:20,939 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 376 transitions, 4855 flow [2022-12-06 07:27:20,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:27:20,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,940 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] [2022-12-06 07:27:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:27:20,940 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 975423946, now seen corresponding path program 1 times [2022-12-06 07:27:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984990628] [2022-12-06 07:27:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,363 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 07:27:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984990628] [2022-12-06 07:27:21,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984990628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:27:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240884079] [2022-12-06 07:27:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:27:21,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:27:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:27:21,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 80 [2022-12-06 07:27:21,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 376 transitions, 4855 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 07:27:21,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 80 [2022-12-06 07:27:21,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,837 INFO L130 PetriNetUnfolder]: 21012/36760 cut-off events. [2022-12-06 07:27:26,838 INFO L131 PetriNetUnfolder]: For 297120/300281 co-relation queries the response was YES. [2022-12-06 07:27:27,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172352 conditions, 36760 events. 21012/36760 cut-off events. For 297120/300281 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 307805 event pairs, 9261 based on Foata normal form. 448/36716 useless extension candidates. Maximal degree in co-relation 165944. Up to 32040 conditions per place. [2022-12-06 07:27:27,196 INFO L137 encePairwiseOnDemand]: 59/80 looper letters, 424 selfloop transitions, 47 changer transitions 0/485 dead transitions. [2022-12-06 07:27:27,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 485 transitions, 6601 flow [2022-12-06 07:27:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:27:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:27:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2022-12-06 07:27:27,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31375 [2022-12-06 07:27:27,197 INFO L175 Difference]: Start difference. First operand has 178 places, 376 transitions, 4855 flow. Second operand 10 states and 251 transitions. [2022-12-06 07:27:27,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 485 transitions, 6601 flow [2022-12-06 07:27:28,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 485 transitions, 6575 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 07:27:28,879 INFO L231 Difference]: Finished difference. Result has 193 places, 398 transitions, 5321 flow [2022-12-06 07:27:28,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=4829, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5321, PETRI_PLACES=193, PETRI_TRANSITIONS=398} [2022-12-06 07:27:28,880 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 140 predicate places. [2022-12-06 07:27:28,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,880 INFO L89 Accepts]: Start accepts. Operand has 193 places, 398 transitions, 5321 flow [2022-12-06 07:27:28,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 398 transitions, 5321 flow [2022-12-06 07:27:28,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 398 transitions, 5321 flow [2022-12-06 07:27:29,224 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][57], [118#L149true, 54#thread1EXITtrue, Black: 278#(and (or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 262#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 276#(and (or (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))) (= ~n1~0 ~n3~0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 274#(and (or (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0)) (= ~n1~0 0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 259#(or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)))) (<= (+ ~n1~0 1) ~n3~0))), Black: 266#(and (<= ~n1~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 260#(or (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)) (<= ~n1~0 ~n2~0))) (= ~n1~0 0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 (+ ~n2~0 1)))), Black: 268#(and (or (<= 1 ~n1~0) (<= ~n2~0 ~n3~0)) (or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))))), Black: 255#(= ~n3~0 0), Black: 257#(or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), Black: 280#(and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n3~0 0)), Black: 272#(and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 (+ ~n2~0 1)) (or (<= (+ 2 ~n1~0) ~n2~0) (= ~n1~0 0))), Black: 264#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 270#(and (or (and (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (< ~n3~0 (+ ~n2~0 1))), Black: 256#(and (<= ~n3~0 ~n2~0) (= ~n3~0 0)), Black: 261#(or (and (or (and (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), 6#L106true, Black: 258#(or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))), 253#true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 308#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 158#(= ~i~0 0), Black: 307#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n1~0 1)), 303#true, Black: 306#(and (<= 0 ~n1~0) (= ~n2~0 0) (<= ~n1~0 0)), Black: 305#(and (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0)), 198#true, 238#true, Black: 319#(and (<= 1 ~n1~0) (<= ~n1~0 1) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 317#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 42#L190-4true, 220#true, Black: 320#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 361#true, Black: 318#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), 348#true, Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 334#(and (<= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 332#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 328#(and (<= ~n2~0 ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), 183#true, Black: 331#(and (<= 1 ~n3~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 210#(= ~e1~0 1), 156#true, Black: 214#(= ~e3~0 1), Black: 345#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0))), Black: 218#(= ~e2~0 1), Black: 350#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 351#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 354#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 352#(and (<= 1 ~n3~0) (= ~n1~0 0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), Black: 355#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 222#(= ~n3~0 0), Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 369#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 368#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)), Black: 365#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 241#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 366#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 371#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)), Black: 243#(<= 1 ~n2~0), Black: 367#(and (= ~n2~0 ~n3~0) (<= 0 ~n3~0) (< ~n2~0 (+ ~n1~0 1))), Black: 242#(= ~n2~0 0), Black: 364#(and (= ~n1~0 0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0))]) [2022-12-06 07:27:29,224 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-06 07:27:29,224 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 07:27:29,224 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:27:29,224 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:27:29,495 INFO L130 PetriNetUnfolder]: 1604/5993 cut-off events. [2022-12-06 07:27:29,495 INFO L131 PetriNetUnfolder]: For 60452/61403 co-relation queries the response was YES. [2022-12-06 07:27:29,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29503 conditions, 5993 events. 1604/5993 cut-off events. For 60452/61403 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 66773 event pairs, 395 based on Foata normal form. 100/5740 useless extension candidates. Maximal degree in co-relation 28764. Up to 1186 conditions per place. [2022-12-06 07:27:29,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 398 transitions, 5321 flow [2022-12-06 07:27:29,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 4328 [2022-12-06 07:27:29,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] L93-->L142: Formula: (and (= (+ (ite (< v_~n3~0_514 v_~n2~0_525) v_~n2~0_525 v_~n3~0_514) 1) v_~n3~0_513) (= (+ v_~n2~0_526 1) v_~n2~0_525) (= v_~e2~0_199 0) (= v_~e3~0_215 0)) InVars {~n2~0=v_~n2~0_526, ~n3~0=v_~n3~0_514} OutVars{~n2~0=v_~n2~0_525, ~n3~0=v_~n3~0_513, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_36|, ~e3~0=v_~e3~0_215, ~e2~0=v_~e2~0_199, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_41|} AuxVars[] AssignedVars[~n2~0, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [517] L99-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_16 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~e1~0=v_~e1~0_16} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-06 07:27:30,061 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:27:30,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1182 [2022-12-06 07:27:30,062 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 398 transitions, 5339 flow [2022-12-06 07:27:30,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 07:27:30,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,062 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] [2022-12-06 07:27:30,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:27:30,063 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash -130438718, now seen corresponding path program 2 times [2022-12-06 07:27:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871084170] [2022-12-06 07:27:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,334 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 07:27:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871084170] [2022-12-06 07:27:30,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871084170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:27:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902011003] [2022-12-06 07:27:30,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:27:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:27:30,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:27:30,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 84 [2022-12-06 07:27:30,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 398 transitions, 5339 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 07:27:30,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 84 [2022-12-06 07:27:30,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,543 INFO L130 PetriNetUnfolder]: 18539/32593 cut-off events. [2022-12-06 07:27:35,543 INFO L131 PetriNetUnfolder]: For 309189/312068 co-relation queries the response was YES. [2022-12-06 07:27:35,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158953 conditions, 32593 events. 18539/32593 cut-off events. For 309189/312068 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 270549 event pairs, 7258 based on Foata normal form. 408/32580 useless extension candidates. Maximal degree in co-relation 152109. Up to 24663 conditions per place. [2022-12-06 07:27:35,831 INFO L137 encePairwiseOnDemand]: 64/84 looper letters, 408 selfloop transitions, 60 changer transitions 5/487 dead transitions. [2022-12-06 07:27:35,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 487 transitions, 7044 flow [2022-12-06 07:27:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:27:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:27:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2022-12-06 07:27:35,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2022-12-06 07:27:35,832 INFO L175 Difference]: Start difference. First operand has 193 places, 398 transitions, 5339 flow. Second operand 6 states and 195 transitions. [2022-12-06 07:27:35,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 487 transitions, 7044 flow [2022-12-06 07:27:37,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 487 transitions, 6931 flow, removed 52 selfloop flow, removed 1 redundant places. [2022-12-06 07:27:37,724 INFO L231 Difference]: Finished difference. Result has 200 places, 402 transitions, 5523 flow [2022-12-06 07:27:37,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=5131, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5523, PETRI_PLACES=200, PETRI_TRANSITIONS=402} [2022-12-06 07:27:37,725 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 147 predicate places. [2022-12-06 07:27:37,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,725 INFO L89 Accepts]: Start accepts. Operand has 200 places, 402 transitions, 5523 flow [2022-12-06 07:27:37,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 402 transitions, 5523 flow [2022-12-06 07:27:37,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 402 transitions, 5523 flow [2022-12-06 07:27:38,098 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][55], [Black: 385#(and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 384#(and (= ~n2~0 0) (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1))), Black: 383#(and (= ~n2~0 ~n3~0) (= ~n3~0 0)), 118#L149true, 54#thread1EXITtrue, Black: 278#(and (or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 262#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 276#(and (or (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))) (= ~n1~0 ~n3~0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 274#(and (or (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0)) (= ~n1~0 0)) (or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))))), Black: 259#(or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)))) (<= (+ ~n1~0 1) ~n3~0))), Black: 266#(and (<= ~n1~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 260#(or (and (or (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= ~n3~0 (+ ~n2~0 1)) (<= ~n1~0 ~n2~0))) (= ~n1~0 0)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 (+ ~n2~0 1)))), Black: 268#(and (or (<= 1 ~n1~0) (<= ~n2~0 ~n3~0)) (or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))))), Black: 255#(= ~n3~0 0), Black: 257#(or (and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)) (and (<= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)))), Black: 280#(and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n3~0 0)), Black: 272#(and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (< ~n3~0 (+ ~n2~0 1)) (or (<= (+ 2 ~n1~0) ~n2~0) (= ~n1~0 0))), Black: 264#(and (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (= ~n3~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 270#(and (or (and (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (< ~n3~0 (+ ~n2~0 1))), Black: 256#(and (<= ~n3~0 ~n2~0) (= ~n3~0 0)), 6#L106true, Black: 261#(or (and (or (and (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (and (<= (+ 2 ~n1~0) ~n2~0) (< ~n2~0 (+ ~n3~0 1)))) (= ~n1~0 0)) (and (<= (+ 2 ~n1~0) ~n2~0) (<= ~n3~0 ~n2~0) (< ~n2~0 (+ ~n3~0 1)))), Black: 258#(or (and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0)) (and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0))), 253#true, Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 308#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 158#(= ~i~0 0), 303#true, Black: 307#(and (<= 1 ~n1~0) (= ~n2~0 0) (<= ~n1~0 1)), Black: 306#(and (<= 0 ~n1~0) (= ~n2~0 0) (<= ~n1~0 0)), Black: 305#(and (= ~n2~0 ~n1~0) (= ~n2~0 ~n3~0) (= ~n3~0 0)), 380#true, 198#true, 238#true, Black: 319#(and (<= 1 ~n1~0) (<= ~n1~0 1) (= ~n3~0 0)), Black: 192#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 220#true, Black: 317#(and (= ~n2~0 ~n1~0) (= ~n3~0 0) (= ~n1~0 0)), 42#L190-4true, Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 320#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 191#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 318#(and (= ~n3~0 0) (= ~n1~0 0)), 361#true, Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 201#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), 348#true, Black: 200#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 203#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 202#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 334#(and (<= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), Black: 332#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 328#(and (<= ~n2~0 ~n3~0) (<= 0 ~n2~0) (= ~n1~0 0)), 183#true, Black: 331#(and (<= 1 ~n3~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 210#(= ~e1~0 1), 156#true, Black: 214#(= ~e3~0 1), Black: 345#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (not (= ~n1~0 0))), Black: 218#(= ~e2~0 1), Black: 350#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 351#(and (= ~n3~0 0) (= ~n1~0 0)), Black: 354#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 0)), Black: 225#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 352#(and (<= 1 ~n3~0) (= ~n1~0 0)), Black: 355#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 229#(and (<= (+ 2 ~n1~0) ~n3~0) (not (= ~n1~0 0))), Black: 226#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (= ~n1~0 ~n3~0)), Black: 222#(= ~n3~0 0), Black: 223#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 369#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 368#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)), Black: 240#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 365#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 366#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 241#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 243#(<= 1 ~n2~0), Black: 371#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)), Black: 367#(and (= ~n2~0 ~n3~0) (<= 0 ~n3~0) (< ~n2~0 (+ ~n1~0 1))), Black: 242#(= ~n2~0 0), Black: 364#(and (= ~n1~0 0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 244#(and (<= 1 ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 245#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0))]) [2022-12-06 07:27:38,098 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-06 07:27:38,098 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:27:38,098 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:27:38,098 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:27:38,299 INFO L130 PetriNetUnfolder]: 1319/5071 cut-off events. [2022-12-06 07:27:38,299 INFO L131 PetriNetUnfolder]: For 53391/54313 co-relation queries the response was YES. [2022-12-06 07:27:38,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25431 conditions, 5071 events. 1319/5071 cut-off events. For 53391/54313 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 55216 event pairs, 331 based on Foata normal form. 118/4872 useless extension candidates. Maximal degree in co-relation 24762. Up to 872 conditions per place. [2022-12-06 07:27:38,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 402 transitions, 5523 flow [2022-12-06 07:27:38,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 4194 [2022-12-06 07:27:38,503 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:27:38,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 779 [2022-12-06 07:27:38,504 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 403 transitions, 5545 flow [2022-12-06 07:27:38,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 07:27:38,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,504 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] [2022-12-06 07:27:38,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:27:38,504 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1569012916, now seen corresponding path program 1 times [2022-12-06 07:27:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587607015] [2022-12-06 07:27:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,947 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 07:27:38,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587607015] [2022-12-06 07:27:38,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587607015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:27:38,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280824225] [2022-12-06 07:27:38,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:27:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:27:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:27:38,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2022-12-06 07:27:38,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 403 transitions, 5545 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 07:27:38,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2022-12-06 07:27:38,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,336 INFO L130 PetriNetUnfolder]: 22558/40071 cut-off events. [2022-12-06 07:27:45,336 INFO L131 PetriNetUnfolder]: For 399730/402176 co-relation queries the response was YES. [2022-12-06 07:27:45,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199590 conditions, 40071 events. 22558/40071 cut-off events. For 399730/402176 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 346663 event pairs, 7835 based on Foata normal form. 568/40273 useless extension candidates. Maximal degree in co-relation 191028. Up to 25962 conditions per place. [2022-12-06 07:27:45,780 INFO L137 encePairwiseOnDemand]: 60/85 looper letters, 487 selfloop transitions, 115 changer transitions 2/618 dead transitions. [2022-12-06 07:27:45,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 618 transitions, 8980 flow [2022-12-06 07:27:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:27:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:27:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2022-12-06 07:27:45,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-06 07:27:45,782 INFO L175 Difference]: Start difference. First operand has 200 places, 403 transitions, 5545 flow. Second operand 10 states and 300 transitions. [2022-12-06 07:27:45,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 618 transitions, 8980 flow [2022-12-06 07:27:48,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 618 transitions, 8895 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 07:27:48,271 INFO L231 Difference]: Finished difference. Result has 212 places, 453 transitions, 6720 flow [2022-12-06 07:27:48,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=5448, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6720, PETRI_PLACES=212, PETRI_TRANSITIONS=453} [2022-12-06 07:27:48,281 INFO L294 CegarLoopForPetriNet]: 53 programPoint places, 159 predicate places. [2022-12-06 07:27:48,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,281 INFO L89 Accepts]: Start accepts. Operand has 212 places, 453 transitions, 6720 flow [2022-12-06 07:27:48,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 453 transitions, 6720 flow [2022-12-06 07:27:48,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 453 transitions, 6720 flow [2022-12-06 07:27:49,095 INFO L130 PetriNetUnfolder]: 1609/6255 cut-off events. [2022-12-06 07:27:49,096 INFO L131 PetriNetUnfolder]: For 78019/79308 co-relation queries the response was YES. [2022-12-06 07:27:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33012 conditions, 6255 events. 1609/6255 cut-off events. For 78019/79308 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 71440 event pairs, 427 based on Foata normal form. 178/6035 useless extension candidates. Maximal degree in co-relation 32214. Up to 1108 conditions per place. [2022-12-06 07:27:49,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 453 transitions, 6720 flow [2022-12-06 07:27:49,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 4736 [2022-12-06 07:27:49,446 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:27:49,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1166 [2022-12-06 07:27:49,447 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 454 transitions, 6749 flow [2022-12-06 07:27:49,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 07:27:49,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,448 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] [2022-12-06 07:27:49,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:27:49,448 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1152298734, now seen corresponding path program 2 times [2022-12-06 07:27:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298540615] [2022-12-06 07:27:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,590 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 07:27:49,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298540615] [2022-12-06 07:27:49,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298540615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:27:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215559598] [2022-12-06 07:27:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:27:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:27:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:27:49,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 88 [2022-12-06 07:27:49,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 454 transitions, 6749 flow. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 88 [2022-12-06 07:27:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand