/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/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:22:36,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:22:36,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:22:36,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:22:36,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:22:36,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:22:36,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:22:36,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:22:36,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:22:36,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:22:36,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:22:36,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:22:36,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:22:36,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:22:36,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:22:36,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:22:36,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:22:36,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:22:36,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:22:36,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:22:36,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:22:36,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:22:36,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:22:36,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:22:36,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:22:36,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:22:36,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:22:36,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:22:36,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:22:36,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:22:36,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:22:36,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:22:36,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:22:36,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:22:36,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:22:36,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:22:36,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:22:36,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:22:36,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:22:36,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:22:36,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:22:36,119 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 06:22:36,150 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:22:36,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:22:36,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:22:36,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:22:36,153 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:22:36,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:22:36,154 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:22:36,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:22:36,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:22:36,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:22:36,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:22:36,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:22:36,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:22:36,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:22:36,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:22:36,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:22:36,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:22:36,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:22:36,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:22:36,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:22:36,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:22:36,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:22:36,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:22:36,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:22:36,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:22:36,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:22:36,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:22:36,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:22:36,158 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 06:22:36,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:22:36,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:22:36,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:22:36,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:22:36,509 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:22:36,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:22:37,703 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:22:37,950 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:22:37,951 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:22:37,963 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcbc8c3a/d81eb2d901f2401095634e3997d26a20/FLAGb0da156fe [2022-12-06 06:22:37,977 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dcbc8c3a/d81eb2d901f2401095634e3997d26a20 [2022-12-06 06:22:37,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:22:37,980 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:22:37,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:22:37,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:22:37,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:22:37,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:22:37" (1/1) ... [2022-12-06 06:22:37,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2066f1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:37, skipping insertion in model container [2022-12-06 06:22:37,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:22:37" (1/1) ... [2022-12-06 06:22:37,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:22:38,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:22:38,152 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:22:38,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:22:38,389 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:22:38,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:22:38,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:22:38,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:22:38,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:22:38,516 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:22:38,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38 WrapperNode [2022-12-06 06:22:38,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:22:38,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:22:38,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:22:38,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:22:38,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,593 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 06:22:38,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:22:38,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:22:38,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:22:38,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:22:38,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:22:38,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:22:38,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:22:38,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:22:38,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (1/1) ... [2022-12-06 06:22:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:22:38,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:22:38,684 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 06:22:38,710 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 06:22:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:22:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:22:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:22:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:22:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:22:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:22:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:22:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:22:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:22:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:22:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:22:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:22:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:22:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:22:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:22:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:22:38,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:22:38,725 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 06:22:38,934 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:22:38,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:22:39,235 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:22:39,414 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:22:39,415 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:22:39,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:22:39 BoogieIcfgContainer [2022-12-06 06:22:39,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:22:39,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:22:39,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:22:39,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:22:39,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:22:37" (1/3) ... [2022-12-06 06:22:39,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33553509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:22:39, skipping insertion in model container [2022-12-06 06:22:39,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:22:38" (2/3) ... [2022-12-06 06:22:39,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33553509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:22:39, skipping insertion in model container [2022-12-06 06:22:39,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:22:39" (3/3) ... [2022-12-06 06:22:39,424 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:22:39,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:22:39,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:22:39,439 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:22:39,496 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:22:39,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 06:22:39,611 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 06:22:39,612 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:22:39,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 06:22:39,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 06:22:39,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 06:22:39,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:39,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 06:22:39,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 06:22:39,698 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 06:22:39,699 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:22:39,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 06:22:39,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 06:22:39,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-06 06:22:44,645 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-06 06:22:44,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:22:44,669 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;@196d7184, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:22:44,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:22:44,673 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:22:44,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:22:44,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:44,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:22:44,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 538882, now seen corresponding path program 1 times [2022-12-06 06:22:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:44,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024455986] [2022-12-06 06:22:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:45,011 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 06:22:45,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:45,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024455986] [2022-12-06 06:22:45,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024455986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:45,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:45,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:22:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672141873] [2022-12-06 06:22:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:45,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:45,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:45,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:22:45,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 06:22:45,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:45,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:22:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:46,159 INFO L130 PetriNetUnfolder]: 6050/8340 cut-off events. [2022-12-06 06:22:46,160 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 06:22:46,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16739 conditions, 8340 events. 6050/8340 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 41734 event pairs, 3098 based on Foata normal form. 0/7600 useless extension candidates. Maximal degree in co-relation 16727. Up to 6574 conditions per place. [2022-12-06 06:22:46,206 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 06:22:46,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 06:22:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 06:22:46,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:22:46,218 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 06:22:46,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 06:22:46,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:22:46,223 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 06:22:46,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 06:22:46,228 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:22:46,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:46,229 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 06:22:46,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:46,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:46,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 06:22:46,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:22:46,248 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:22:46,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:22:46,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:22:46,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:22:46,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:22:46,353 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:46,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 06:22:46,356 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 06:22:46,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 06:22:46,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:46,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:46,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:22:46,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:46,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1532157591, now seen corresponding path program 1 times [2022-12-06 06:22:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:46,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825002328] [2022-12-06 06:22:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:46,657 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 06:22:46,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:46,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825002328] [2022-12-06 06:22:46,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825002328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:46,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:46,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:22:46,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115629094] [2022-12-06 06:22:46,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:46,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:46,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:22:46,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 06:22:46,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:46,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:22:46,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:48,985 INFO L130 PetriNetUnfolder]: 16443/22329 cut-off events. [2022-12-06 06:22:48,985 INFO L131 PetriNetUnfolder]: For 1116/1116 co-relation queries the response was YES. [2022-12-06 06:22:49,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46175 conditions, 22329 events. 16443/22329 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 116729 event pairs, 6427 based on Foata normal form. 704/23033 useless extension candidates. Maximal degree in co-relation 46165. Up to 11662 conditions per place. [2022-12-06 06:22:49,109 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2022-12-06 06:22:49,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-06 06:22:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:22:49,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 06:22:49,112 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:22:49,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-06 06:22:49,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:49,115 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 134 flow [2022-12-06 06:22:49,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 06:22:49,116 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-06 06:22:49,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:49,116 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 134 flow [2022-12-06 06:22:49,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:49,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:49,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 134 flow [2022-12-06 06:22:49,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 134 flow [2022-12-06 06:22:49,189 INFO L130 PetriNetUnfolder]: 410/954 cut-off events. [2022-12-06 06:22:49,190 INFO L131 PetriNetUnfolder]: For 132/142 co-relation queries the response was YES. [2022-12-06 06:22:49,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1924 conditions, 954 events. 410/954 cut-off events. For 132/142 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6600 event pairs, 164 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1915. Up to 385 conditions per place. [2022-12-06 06:22:49,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 134 flow [2022-12-06 06:22:49,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 06:22:49,254 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:49,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 06:22:49,256 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 134 flow [2022-12-06 06:22:49,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 06:22:49,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:49,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:22:49,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:49,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 252245413, now seen corresponding path program 1 times [2022-12-06 06:22:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:49,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377238854] [2022-12-06 06:22:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:49,457 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 06:22:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377238854] [2022-12-06 06:22:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377238854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:49,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:49,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288528464] [2022-12-06 06:22:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:49,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:22:49,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 134 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 06:22:49,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:49,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:22:49,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:51,749 INFO L130 PetriNetUnfolder]: 15313/20798 cut-off events. [2022-12-06 06:22:51,749 INFO L131 PetriNetUnfolder]: For 10508/10508 co-relation queries the response was YES. [2022-12-06 06:22:51,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53933 conditions, 20798 events. 15313/20798 cut-off events. For 10508/10508 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 105633 event pairs, 3500 based on Foata normal form. 170/20968 useless extension candidates. Maximal degree in co-relation 53921. Up to 8467 conditions per place. [2022-12-06 06:22:51,846 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-06 06:22:51,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 356 flow [2022-12-06 06:22:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 06:22:51,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 06:22:51,849 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 134 flow. Second operand 4 states and 60 transitions. [2022-12-06 06:22:51,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 356 flow [2022-12-06 06:22:51,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:51,883 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 184 flow [2022-12-06 06:22:51,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-06 06:22:51,885 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-06 06:22:51,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:51,885 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 184 flow [2022-12-06 06:22:51,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:51,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:51,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 184 flow [2022-12-06 06:22:51,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 184 flow [2022-12-06 06:22:51,941 INFO L130 PetriNetUnfolder]: 288/687 cut-off events. [2022-12-06 06:22:51,941 INFO L131 PetriNetUnfolder]: For 357/359 co-relation queries the response was YES. [2022-12-06 06:22:51,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 687 events. 288/687 cut-off events. For 357/359 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4244 event pairs, 78 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 1607. Up to 272 conditions per place. [2022-12-06 06:22:51,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 184 flow [2022-12-06 06:22:51,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-06 06:22:51,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:51,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 06:22:51,981 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 184 flow [2022-12-06 06:22:51,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 06:22:51,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:51,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:22:51,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash -771249249, now seen corresponding path program 1 times [2022-12-06 06:22:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:51,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927900650] [2022-12-06 06:22:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:52,170 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 06:22:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:52,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927900650] [2022-12-06 06:22:52,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927900650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:52,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:52,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695179812] [2022-12-06 06:22:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:52,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:52,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:52,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:22:52,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 184 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 06:22:52,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:52,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:22:52,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:53,815 INFO L130 PetriNetUnfolder]: 15055/20452 cut-off events. [2022-12-06 06:22:53,816 INFO L131 PetriNetUnfolder]: For 14652/14652 co-relation queries the response was YES. [2022-12-06 06:22:53,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56354 conditions, 20452 events. 15055/20452 cut-off events. For 14652/14652 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 106066 event pairs, 1461 based on Foata normal form. 40/20492 useless extension candidates. Maximal degree in co-relation 56339. Up to 9914 conditions per place. [2022-12-06 06:22:53,920 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 63 selfloop transitions, 20 changer transitions 0/83 dead transitions. [2022-12-06 06:22:53,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 512 flow [2022-12-06 06:22:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 06:22:53,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:22:53,922 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 184 flow. Second operand 4 states and 68 transitions. [2022-12-06 06:22:53,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 512 flow [2022-12-06 06:22:53,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:53,975 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 364 flow [2022-12-06 06:22:53,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2022-12-06 06:22:53,976 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-06 06:22:53,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:53,976 INFO L89 Accepts]: Start accepts. Operand has 50 places, 54 transitions, 364 flow [2022-12-06 06:22:53,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:53,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:53,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 54 transitions, 364 flow [2022-12-06 06:22:53,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 54 transitions, 364 flow [2022-12-06 06:22:54,028 INFO L130 PetriNetUnfolder]: 255/628 cut-off events. [2022-12-06 06:22:54,028 INFO L131 PetriNetUnfolder]: For 1141/1238 co-relation queries the response was YES. [2022-12-06 06:22:54,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 628 events. 255/628 cut-off events. For 1141/1238 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3830 event pairs, 52 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 1948. Up to 237 conditions per place. [2022-12-06 06:22:54,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 54 transitions, 364 flow [2022-12-06 06:22:54,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-06 06:22:54,041 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:54,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 06:22:54,045 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 364 flow [2022-12-06 06:22:54,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 06:22:54,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:54,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:54,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:22:54,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1888226368, now seen corresponding path program 1 times [2022-12-06 06:22:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:54,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931310689] [2022-12-06 06:22:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:54,280 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 06:22:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:54,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931310689] [2022-12-06 06:22:54,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931310689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:54,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:54,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968512367] [2022-12-06 06:22:54,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:54,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:54,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:22:54,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 364 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 06:22:54,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:54,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:22:54,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:56,141 INFO L130 PetriNetUnfolder]: 14856/20185 cut-off events. [2022-12-06 06:22:56,141 INFO L131 PetriNetUnfolder]: For 36068/36068 co-relation queries the response was YES. [2022-12-06 06:22:56,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64493 conditions, 20185 events. 14856/20185 cut-off events. For 36068/36068 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 104285 event pairs, 2533 based on Foata normal form. 32/20217 useless extension candidates. Maximal degree in co-relation 64474. Up to 9866 conditions per place. [2022-12-06 06:22:56,282 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 68 selfloop transitions, 34 changer transitions 0/102 dead transitions. [2022-12-06 06:22:56,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 804 flow [2022-12-06 06:22:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:22:56,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 06:22:56,286 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 364 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:22:56,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 804 flow [2022-12-06 06:22:56,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 102 transitions, 804 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:22:56,380 INFO L231 Difference]: Finished difference. Result has 56 places, 70 transitions, 667 flow [2022-12-06 06:22:56,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=667, PETRI_PLACES=56, PETRI_TRANSITIONS=70} [2022-12-06 06:22:56,383 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2022-12-06 06:22:56,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:56,383 INFO L89 Accepts]: Start accepts. Operand has 56 places, 70 transitions, 667 flow [2022-12-06 06:22:56,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:56,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:56,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 70 transitions, 667 flow [2022-12-06 06:22:56,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 70 transitions, 667 flow [2022-12-06 06:22:56,450 INFO L130 PetriNetUnfolder]: 237/594 cut-off events. [2022-12-06 06:22:56,450 INFO L131 PetriNetUnfolder]: For 1934/2177 co-relation queries the response was YES. [2022-12-06 06:22:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 594 events. 237/594 cut-off events. For 1934/2177 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3649 event pairs, 20 based on Foata normal form. 1/590 useless extension candidates. Maximal degree in co-relation 2309. Up to 221 conditions per place. [2022-12-06 06:22:56,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 70 transitions, 667 flow [2022-12-06 06:22:56,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 06:22:56,538 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:56,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 06:22:56,541 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 70 transitions, 667 flow [2022-12-06 06:22:56,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 06:22:56,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:56,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:56,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:22:56,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1551135486, now seen corresponding path program 1 times [2022-12-06 06:22:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:56,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878976063] [2022-12-06 06:22:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:56,689 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 06:22:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:56,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878976063] [2022-12-06 06:22:56,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878976063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:56,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:56,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139180924] [2022-12-06 06:22:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:56,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:56,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:22:56,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 70 transitions, 667 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 06:22:56,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:56,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:22:56,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:59,153 INFO L130 PetriNetUnfolder]: 20582/28191 cut-off events. [2022-12-06 06:22:59,153 INFO L131 PetriNetUnfolder]: For 93864/93864 co-relation queries the response was YES. [2022-12-06 06:22:59,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97033 conditions, 28191 events. 20582/28191 cut-off events. For 93864/93864 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 155542 event pairs, 4610 based on Foata normal form. 300/28491 useless extension candidates. Maximal degree in co-relation 97009. Up to 11643 conditions per place. [2022-12-06 06:22:59,265 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 68 selfloop transitions, 41 changer transitions 2/111 dead transitions. [2022-12-06 06:22:59,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 1081 flow [2022-12-06 06:22:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 06:22:59,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2022-12-06 06:22:59,268 INFO L175 Difference]: Start difference. First operand has 56 places, 70 transitions, 667 flow. Second operand 4 states and 73 transitions. [2022-12-06 06:22:59,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 1081 flow [2022-12-06 06:22:59,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 1081 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:22:59,471 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 920 flow [2022-12-06 06:22:59,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2022-12-06 06:22:59,474 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-06 06:22:59,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:59,474 INFO L89 Accepts]: Start accepts. Operand has 62 places, 75 transitions, 920 flow [2022-12-06 06:22:59,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:59,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:59,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 75 transitions, 920 flow [2022-12-06 06:22:59,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 75 transitions, 920 flow [2022-12-06 06:22:59,547 INFO L130 PetriNetUnfolder]: 225/650 cut-off events. [2022-12-06 06:22:59,547 INFO L131 PetriNetUnfolder]: For 3399/3763 co-relation queries the response was YES. [2022-12-06 06:22:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 650 events. 225/650 cut-off events. For 3399/3763 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4395 event pairs, 20 based on Foata normal form. 2/647 useless extension candidates. Maximal degree in co-relation 2876. Up to 224 conditions per place. [2022-12-06 06:22:59,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 75 transitions, 920 flow [2022-12-06 06:22:59,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 994 [2022-12-06 06:22:59,564 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:59,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 06:22:59,565 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 920 flow [2022-12-06 06:22:59,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 06:22:59,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:59,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:59,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:22:59,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1550781838, now seen corresponding path program 1 times [2022-12-06 06:22:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:59,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531376266] [2022-12-06 06:22:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:59,751 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 06:22:59,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:59,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531376266] [2022-12-06 06:22:59,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531376266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:59,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:59,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626334978] [2022-12-06 06:22:59,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:59,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:59,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:22:59,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 920 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 06:22:59,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:59,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:22:59,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:01,881 INFO L130 PetriNetUnfolder]: 13142/19575 cut-off events. [2022-12-06 06:23:01,881 INFO L131 PetriNetUnfolder]: For 98691/102043 co-relation queries the response was YES. [2022-12-06 06:23:01,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67014 conditions, 19575 events. 13142/19575 cut-off events. For 98691/102043 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 131528 event pairs, 1900 based on Foata normal form. 2020/21160 useless extension candidates. Maximal degree in co-relation 66985. Up to 8314 conditions per place. [2022-12-06 06:23:01,986 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 114 selfloop transitions, 6 changer transitions 0/148 dead transitions. [2022-12-06 06:23:01,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 148 transitions, 1932 flow [2022-12-06 06:23:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:23:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:23:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 06:23:01,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2022-12-06 06:23:01,988 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 920 flow. Second operand 4 states and 75 transitions. [2022-12-06 06:23:01,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 148 transitions, 1932 flow [2022-12-06 06:23:02,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 148 transitions, 1926 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 06:23:02,024 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 964 flow [2022-12-06 06:23:02,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=964, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2022-12-06 06:23:02,025 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-06 06:23:02,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:02,025 INFO L89 Accepts]: Start accepts. Operand has 67 places, 80 transitions, 964 flow [2022-12-06 06:23:02,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:02,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:02,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 80 transitions, 964 flow [2022-12-06 06:23:02,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 80 transitions, 964 flow [2022-12-06 06:23:02,189 INFO L130 PetriNetUnfolder]: 949/2169 cut-off events. [2022-12-06 06:23:02,189 INFO L131 PetriNetUnfolder]: For 5429/5959 co-relation queries the response was YES. [2022-12-06 06:23:02,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 2169 events. 949/2169 cut-off events. For 5429/5959 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 18747 event pairs, 320 based on Foata normal form. 7/1909 useless extension candidates. Maximal degree in co-relation 6933. Up to 1400 conditions per place. [2022-12-06 06:23:02,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 80 transitions, 964 flow [2022-12-06 06:23:02,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 1302 [2022-12-06 06:23:02,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:23:02,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 533 [2022-12-06 06:23:02,558 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 80 transitions, 966 flow [2022-12-06 06:23:02,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 06:23:02,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:02,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:02,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:23:02,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:02,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1586705727, now seen corresponding path program 1 times [2022-12-06 06:23:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:02,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355924786] [2022-12-06 06:23:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:02,846 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 06:23:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:02,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355924786] [2022-12-06 06:23:02,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355924786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:02,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:02,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:23:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468432207] [2022-12-06 06:23:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:23:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:23:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:23:02,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:23:02,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 80 transitions, 966 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 06:23:02,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:02,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:23:02,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:03,634 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L822-->L838: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_129 256) 0) .cse5)) (.cse6 (and .cse3 .cse5))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_128 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse9 (or .cse11 .cse8 .cse6)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse5 .cse2) .cse4 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse7 (not .cse4)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a~0_79 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_129 (ite (or .cse8 .cse4 .cse6) v_~a$w_buff1_used~0_129 0)) v_~a$w_buff1_used~0_128) (= (ite .cse9 v_~a~0_79 (ite .cse10 v_~a$w_buff0~0_67 v_~a$w_buff1~0_58)) v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_78 (ite .cse0 v_~a$mem_tmp~0_14 v_~__unbuffered_p3_EBX~0_10)) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_129, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_128, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][110], [170#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 156#true, 128#L782true, 46#P2EXITtrue, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 121#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 72#L762true, Black: 158#(<= ~__unbuffered_p3_EAX~0 0), Black: 165#(= ~y~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(= ~x~0 0), Black: 173#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 200#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 179#(= ~y~0 1), Black: 177#true, 85#L872true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 184#true, 163#true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 187#(= ~main$tmp_guard0~0 0)]) [2022-12-06 06:23:03,635 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 06:23:03,635 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 06:23:03,635 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 06:23:03,635 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 06:23:03,741 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_117 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~a~0_64 (ite .cse0 v_~a$w_buff0~0_56 (ite .cse1 v_~a$w_buff1~0_47 v_~a~0_65))) (= v_~a$r_buff0_thd2~0_25 (ite .cse2 0 v_~a$r_buff0_thd2~0_26)) (= (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_116 256) 0)) .cse4)) 0 v_~a$r_buff1_thd2~0_24) v_~a$r_buff1_thd2~0_23) (= (ite .cse0 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_117) v_~a$w_buff1_used~0_116)))) InVars {~a~0=v_~a~0_65, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_117} OutVars{~a~0=v_~a~0_64, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_116} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][37], [P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 56#L769true, 166#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 96#L789true, Black: 151#true, 46#P2EXITtrue, Black: 156#true, Black: 158#(<= ~__unbuffered_p3_EAX~0 0), Black: 165#(= ~y~0 0), Black: 163#true, 173#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 170#true, Black: 172#(= ~x~0 0), 40#L822true, 179#(= ~y~0 1), 200#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), Black: 177#true, 85#L872true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 184#true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 187#(= ~main$tmp_guard0~0 0)]) [2022-12-06 06:23:03,742 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,742 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,742 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,742 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,742 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L822-->L838: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_129 256) 0) .cse5)) (.cse6 (and .cse3 .cse5))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_128 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse9 (or .cse11 .cse8 .cse6)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse5 .cse2) .cse4 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse7 (not .cse4)) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a~0_79 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_129 (ite (or .cse8 .cse4 .cse6) v_~a$w_buff1_used~0_129 0)) v_~a$w_buff1_used~0_128) (= (ite .cse9 v_~a~0_79 (ite .cse10 v_~a$w_buff0~0_67 v_~a$w_buff1~0_58)) v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_78 (ite .cse0 v_~a$mem_tmp~0_14 v_~__unbuffered_p3_EBX~0_10)) (= (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140))) v_~a$w_buff0_used~0_139))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_129, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_128, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][110], [170#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 56#L769true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 156#true, 128#L782true, 46#P2EXITtrue, Black: 153#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 121#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(<= ~__unbuffered_p3_EAX~0 0), Black: 165#(= ~y~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(= ~x~0 0), Black: 173#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 179#(= ~y~0 1), 200#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), Black: 177#true, 85#L872true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 184#true, 163#true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 187#(= ~main$tmp_guard0~0 0)]) [2022-12-06 06:23:03,742 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,742 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,742 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:23:03,743 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:23:04,106 INFO L130 PetriNetUnfolder]: 7184/11187 cut-off events. [2022-12-06 06:23:04,106 INFO L131 PetriNetUnfolder]: For 56357/57846 co-relation queries the response was YES. [2022-12-06 06:23:04,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44164 conditions, 11187 events. 7184/11187 cut-off events. For 56357/57846 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 73155 event pairs, 778 based on Foata normal form. 1261/12166 useless extension candidates. Maximal degree in co-relation 44131. Up to 4288 conditions per place. [2022-12-06 06:23:04,158 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 133 selfloop transitions, 10 changer transitions 0/171 dead transitions. [2022-12-06 06:23:04,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 171 transitions, 2179 flow [2022-12-06 06:23:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:23:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:23:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-06 06:23:04,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6620689655172414 [2022-12-06 06:23:04,160 INFO L175 Difference]: Start difference. First operand has 67 places, 80 transitions, 966 flow. Second operand 5 states and 96 transitions. [2022-12-06 06:23:04,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 171 transitions, 2179 flow [2022-12-06 06:23:04,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 171 transitions, 2168 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:23:04,189 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 1017 flow [2022-12-06 06:23:04,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1017, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2022-12-06 06:23:04,190 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2022-12-06 06:23:04,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:04,190 INFO L89 Accepts]: Start accepts. Operand has 71 places, 84 transitions, 1017 flow [2022-12-06 06:23:04,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:04,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:04,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 84 transitions, 1017 flow [2022-12-06 06:23:04,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 84 transitions, 1017 flow [2022-12-06 06:23:04,340 INFO L130 PetriNetUnfolder]: 660/1644 cut-off events. [2022-12-06 06:23:04,341 INFO L131 PetriNetUnfolder]: For 4864/5439 co-relation queries the response was YES. [2022-12-06 06:23:04,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 1644 events. 660/1644 cut-off events. For 4864/5439 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 13521 event pairs, 74 based on Foata normal form. 52/1587 useless extension candidates. Maximal degree in co-relation 6489. Up to 951 conditions per place. [2022-12-06 06:23:04,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 84 transitions, 1017 flow [2022-12-06 06:23:04,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 1396 [2022-12-06 06:23:04,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:23:04,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 454 [2022-12-06 06:23:04,644 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 1021 flow [2022-12-06 06:23:04,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 06:23:04,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:04,644 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] [2022-12-06 06:23:04,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:23:04,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1695760011, now seen corresponding path program 1 times [2022-12-06 06:23:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:04,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295240737] [2022-12-06 06:23:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:04,775 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 06:23:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:04,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295240737] [2022-12-06 06:23:04,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295240737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:04,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:04,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:23:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116143205] [2022-12-06 06:23:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:04,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:23:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:23:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:23:04,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 06:23:04,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 06:23:04,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:04,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 06:23:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:05,994 INFO L130 PetriNetUnfolder]: 8308/13029 cut-off events. [2022-12-06 06:23:05,995 INFO L131 PetriNetUnfolder]: For 69796/70551 co-relation queries the response was YES. [2022-12-06 06:23:06,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57242 conditions, 13029 events. 8308/13029 cut-off events. For 69796/70551 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 85903 event pairs, 3658 based on Foata normal form. 331/13041 useless extension candidates. Maximal degree in co-relation 57207. Up to 6693 conditions per place. [2022-12-06 06:23:06,061 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 77 selfloop transitions, 12 changer transitions 13/117 dead transitions. [2022-12-06 06:23:06,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 1472 flow [2022-12-06 06:23:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:23:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:23:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 06:23:06,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-06 06:23:06,063 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 1021 flow. Second operand 3 states and 55 transitions. [2022-12-06 06:23:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 1472 flow [2022-12-06 06:23:06,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 1420 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 06:23:06,253 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 925 flow [2022-12-06 06:23:06,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2022-12-06 06:23:06,253 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-06 06:23:06,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:06,254 INFO L89 Accepts]: Start accepts. Operand has 70 places, 77 transitions, 925 flow [2022-12-06 06:23:06,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:06,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:06,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 77 transitions, 925 flow [2022-12-06 06:23:06,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 77 transitions, 925 flow [2022-12-06 06:23:06,521 INFO L130 PetriNetUnfolder]: 649/1657 cut-off events. [2022-12-06 06:23:06,522 INFO L131 PetriNetUnfolder]: For 4489/4880 co-relation queries the response was YES. [2022-12-06 06:23:06,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5826 conditions, 1657 events. 649/1657 cut-off events. For 4489/4880 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 13601 event pairs, 114 based on Foata normal form. 65/1648 useless extension candidates. Maximal degree in co-relation 5795. Up to 914 conditions per place. [2022-12-06 06:23:06,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 77 transitions, 925 flow [2022-12-06 06:23:06,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-06 06:23:06,554 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:06,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-06 06:23:06,555 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 925 flow [2022-12-06 06:23:06,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 06:23:06,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:06,555 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] [2022-12-06 06:23:06,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:23:06,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -345104021, now seen corresponding path program 1 times [2022-12-06 06:23:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:06,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481992118] [2022-12-06 06:23:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:07,030 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 06:23:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481992118] [2022-12-06 06:23:07,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481992118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:07,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:07,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:23:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593472420] [2022-12-06 06:23:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:07,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:23:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:07,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:23:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:23:07,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:23:07,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 925 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 06:23:07,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:07,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:23:07,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:08,219 INFO L130 PetriNetUnfolder]: 6351/10086 cut-off events. [2022-12-06 06:23:08,219 INFO L131 PetriNetUnfolder]: For 49222/50034 co-relation queries the response was YES. [2022-12-06 06:23:08,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39904 conditions, 10086 events. 6351/10086 cut-off events. For 49222/50034 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 67432 event pairs, 1014 based on Foata normal form. 738/10510 useless extension candidates. Maximal degree in co-relation 39870. Up to 3330 conditions per place. [2022-12-06 06:23:08,256 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 130 selfloop transitions, 14 changer transitions 11/177 dead transitions. [2022-12-06 06:23:08,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 177 transitions, 2249 flow [2022-12-06 06:23:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:23:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:23:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-06 06:23:08,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6845238095238095 [2022-12-06 06:23:08,260 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 925 flow. Second operand 6 states and 115 transitions. [2022-12-06 06:23:08,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 177 transitions, 2249 flow [2022-12-06 06:23:08,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 177 transitions, 2214 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:23:08,277 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 955 flow [2022-12-06 06:23:08,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2022-12-06 06:23:08,278 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2022-12-06 06:23:08,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:08,278 INFO L89 Accepts]: Start accepts. Operand has 76 places, 80 transitions, 955 flow [2022-12-06 06:23:08,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:08,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:08,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 955 flow [2022-12-06 06:23:08,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 955 flow [2022-12-06 06:23:08,401 INFO L130 PetriNetUnfolder]: 585/1496 cut-off events. [2022-12-06 06:23:08,401 INFO L131 PetriNetUnfolder]: For 5787/6280 co-relation queries the response was YES. [2022-12-06 06:23:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 1496 events. 585/1496 cut-off events. For 5787/6280 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 11998 event pairs, 27 based on Foata normal form. 78/1514 useless extension candidates. Maximal degree in co-relation 6514. Up to 770 conditions per place. [2022-12-06 06:23:08,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 955 flow [2022-12-06 06:23:08,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 1186 [2022-12-06 06:23:08,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:23:08,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 344 [2022-12-06 06:23:08,622 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 961 flow [2022-12-06 06:23:08,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 06:23:08,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:08,623 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] [2022-12-06 06:23:08,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:23:08,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1162942379, now seen corresponding path program 1 times [2022-12-06 06:23:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:08,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756332914] [2022-12-06 06:23:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:08,833 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 06:23:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:08,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756332914] [2022-12-06 06:23:08,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756332914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:08,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:08,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:23:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699227416] [2022-12-06 06:23:08,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:08,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:23:08,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:08,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:23:08,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:23:08,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:23:08,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 961 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 06:23:08,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:08,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:23:08,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:09,847 INFO L130 PetriNetUnfolder]: 5302/8316 cut-off events. [2022-12-06 06:23:09,847 INFO L131 PetriNetUnfolder]: For 43958/44532 co-relation queries the response was YES. [2022-12-06 06:23:09,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36384 conditions, 8316 events. 5302/8316 cut-off events. For 43958/44532 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 53843 event pairs, 993 based on Foata normal form. 239/8257 useless extension candidates. Maximal degree in co-relation 36347. Up to 3297 conditions per place. [2022-12-06 06:23:09,872 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 74 selfloop transitions, 18 changer transitions 51/154 dead transitions. [2022-12-06 06:23:09,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 154 transitions, 1966 flow [2022-12-06 06:23:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:23:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:23:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 06:23:09,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5221674876847291 [2022-12-06 06:23:09,873 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 961 flow. Second operand 7 states and 106 transitions. [2022-12-06 06:23:09,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 154 transitions, 1966 flow [2022-12-06 06:23:10,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 154 transitions, 1908 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-06 06:23:10,067 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 578 flow [2022-12-06 06:23:10,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2022-12-06 06:23:10,068 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2022-12-06 06:23:10,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:10,068 INFO L89 Accepts]: Start accepts. Operand has 78 places, 56 transitions, 578 flow [2022-12-06 06:23:10,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:10,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:10,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 56 transitions, 578 flow [2022-12-06 06:23:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 56 transitions, 578 flow [2022-12-06 06:23:10,083 INFO L130 PetriNetUnfolder]: 70/190 cut-off events. [2022-12-06 06:23:10,084 INFO L131 PetriNetUnfolder]: For 634/692 co-relation queries the response was YES. [2022-12-06 06:23:10,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 190 events. 70/190 cut-off events. For 634/692 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 794 event pairs, 1 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 813. Up to 59 conditions per place. [2022-12-06 06:23:10,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 56 transitions, 578 flow [2022-12-06 06:23:10,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 06:23:10,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] L845-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P3Thread1of1ForFork0_#res.base_7| 0) (= |v_P3Thread1of1ForFork0_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [418] L869-3-->L872: Formula: (= v_~main$tmp_guard0~0_6 (ite (= (ite (= v_~__unbuffered_cnt~0_21 4) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 06:23:10,108 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [440] L809-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [418] L869-3-->L872: Formula: (= v_~main$tmp_guard0~0_6 (ite (= (ite (= v_~__unbuffered_cnt~0_21 4) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 06:23:10,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L789-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [418] L869-3-->L872: Formula: (= v_~main$tmp_guard0~0_6 (ite (= (ite (= v_~__unbuffered_cnt~0_21 4) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 06:23:10,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L769-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59) (= |v_P0Thread1of1ForFork3_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P0Thread1of1ForFork3_#res#1.offset=|v_P0Thread1of1ForFork3_#res#1.offset_7|, P0Thread1of1ForFork3_#res#1.base=|v_P0Thread1of1ForFork3_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res#1.offset, P0Thread1of1ForFork3_#res#1.base, ~__unbuffered_cnt~0] and [418] L869-3-->L872: Formula: (= v_~main$tmp_guard0~0_6 (ite (= (ite (= v_~__unbuffered_cnt~0_21 4) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 06:23:11,554 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:23:11,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1487 [2022-12-06 06:23:11,555 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 592 flow [2022-12-06 06:23:11,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 06:23:11,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:11,555 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] [2022-12-06 06:23:11,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:23:11,556 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1910251667, now seen corresponding path program 1 times [2022-12-06 06:23:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:11,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055615593] [2022-12-06 06:23:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:11,785 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 06:23:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:11,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055615593] [2022-12-06 06:23:11,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055615593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:11,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:11,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:23:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882378896] [2022-12-06 06:23:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:11,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:23:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:23:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:23:11,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:23:11,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 592 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 06:23:11,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:11,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:23:11,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:12,132 INFO L130 PetriNetUnfolder]: 1400/2170 cut-off events. [2022-12-06 06:23:12,132 INFO L131 PetriNetUnfolder]: For 11742/11742 co-relation queries the response was YES. [2022-12-06 06:23:12,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9733 conditions, 2170 events. 1400/2170 cut-off events. For 11742/11742 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9692 event pairs, 180 based on Foata normal form. 4/2174 useless extension candidates. Maximal degree in co-relation 9696. Up to 955 conditions per place. [2022-12-06 06:23:12,144 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 55 selfloop transitions, 6 changer transitions 28/89 dead transitions. [2022-12-06 06:23:12,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 976 flow [2022-12-06 06:23:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:23:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:23:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 06:23:12,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2022-12-06 06:23:12,146 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 592 flow. Second operand 4 states and 62 transitions. [2022-12-06 06:23:12,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 976 flow [2022-12-06 06:23:12,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 691 flow, removed 24 selfloop flow, removed 20 redundant places. [2022-12-06 06:23:12,169 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 227 flow [2022-12-06 06:23:12,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2022-12-06 06:23:12,170 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2022-12-06 06:23:12,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:12,170 INFO L89 Accepts]: Start accepts. Operand has 59 places, 37 transitions, 227 flow [2022-12-06 06:23:12,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:12,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:12,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 37 transitions, 227 flow [2022-12-06 06:23:12,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 37 transitions, 227 flow [2022-12-06 06:23:12,179 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-06 06:23:12,180 INFO L131 PetriNetUnfolder]: For 63/64 co-relation queries the response was YES. [2022-12-06 06:23:12,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 53 events. 17/53 cut-off events. For 63/64 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 139. Up to 12 conditions per place. [2022-12-06 06:23:12,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 37 transitions, 227 flow [2022-12-06 06:23:12,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 06:23:12,959 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:23:12,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 790 [2022-12-06 06:23:12,960 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 193 flow [2022-12-06 06:23:12,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 06:23:12,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:12,960 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] [2022-12-06 06:23:12,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:23:12,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1866927079, now seen corresponding path program 1 times [2022-12-06 06:23:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:12,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027832081] [2022-12-06 06:23:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:14,020 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 06:23:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:14,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027832081] [2022-12-06 06:23:14,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027832081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:14,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:14,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:23:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042371472] [2022-12-06 06:23:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:14,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:23:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:23:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:23:14,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:23:14,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 193 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:23:14,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:14,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:23:14,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:14,298 INFO L130 PetriNetUnfolder]: 623/1003 cut-off events. [2022-12-06 06:23:14,298 INFO L131 PetriNetUnfolder]: For 3234/3234 co-relation queries the response was YES. [2022-12-06 06:23:14,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1003 events. 623/1003 cut-off events. For 3234/3234 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4373 event pairs, 53 based on Foata normal form. 4/1007 useless extension candidates. Maximal degree in co-relation 3374. Up to 402 conditions per place. [2022-12-06 06:23:14,301 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 62 selfloop transitions, 8 changer transitions 24/94 dead transitions. [2022-12-06 06:23:14,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 690 flow [2022-12-06 06:23:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:23:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:23:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 06:23:14,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:23:14,302 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 193 flow. Second operand 6 states and 72 transitions. [2022-12-06 06:23:14,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 690 flow [2022-12-06 06:23:14,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 535 flow, removed 42 selfloop flow, removed 15 redundant places. [2022-12-06 06:23:14,305 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 199 flow [2022-12-06 06:23:14,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-06 06:23:14,306 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2022-12-06 06:23:14,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:14,306 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 199 flow [2022-12-06 06:23:14,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:14,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:14,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 199 flow [2022-12-06 06:23:14,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 199 flow [2022-12-06 06:23:14,315 INFO L130 PetriNetUnfolder]: 39/91 cut-off events. [2022-12-06 06:23:14,315 INFO L131 PetriNetUnfolder]: For 62/63 co-relation queries the response was YES. [2022-12-06 06:23:14,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 91 events. 39/91 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 269 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 203. Up to 28 conditions per place. [2022-12-06 06:23:14,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 199 flow [2022-12-06 06:23:14,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 06:23:14,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:14,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 06:23:14,349 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 199 flow [2022-12-06 06:23:14,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:23:14,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:14,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] [2022-12-06 06:23:14,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:23:14,350 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:23:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1844360285, now seen corresponding path program 2 times [2022-12-06 06:23:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694704463] [2022-12-06 06:23:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:23:14,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:23:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:23:14,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:23:14,511 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:23:14,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:23:14,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:23:14,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:23:14,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:23:14,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:23:14,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:23:14,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:23:14,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:23:14,515 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:14,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:23:14,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:23:14,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:23:14 BasicIcfg [2022-12-06 06:23:14,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:23:14,603 INFO L158 Benchmark]: Toolchain (without parser) took 36623.30ms. Allocated memory was 181.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 157.0MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 716.6MB. Max. memory is 8.0GB. [2022-12-06 06:23:14,604 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 159.0MB in the beginning and 158.9MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:23:14,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.57ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 128.7MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:23:14,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.78ms. Allocated memory is still 181.4MB. Free memory was 128.7MB in the beginning and 126.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:23:14,605 INFO L158 Benchmark]: Boogie Preprocessor took 52.63ms. Allocated memory is still 181.4MB. Free memory was 126.2MB in the beginning and 124.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:23:14,606 INFO L158 Benchmark]: RCFGBuilder took 770.06ms. Allocated memory was 181.4MB in the beginning and 247.5MB in the end (delta: 66.1MB). Free memory was 124.1MB in the beginning and 222.3MB in the end (delta: -98.1MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2022-12-06 06:23:14,606 INFO L158 Benchmark]: TraceAbstraction took 35183.81ms. Allocated memory was 247.5MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 221.7MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 713.7MB. Max. memory is 8.0GB. [2022-12-06 06:23:14,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 159.0MB in the beginning and 158.9MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 535.57ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 128.7MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.78ms. Allocated memory is still 181.4MB. Free memory was 128.7MB in the beginning and 126.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.63ms. Allocated memory is still 181.4MB. Free memory was 126.2MB in the beginning and 124.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 770.06ms. Allocated memory was 181.4MB in the beginning and 247.5MB in the end (delta: 66.1MB). Free memory was 124.1MB in the beginning and 222.3MB in the end (delta: -98.1MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35183.81ms. Allocated memory was 247.5MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 221.7MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 713.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 136 PlacesBefore, 48 PlacesAfterwards, 125 TransitionsBefore, 36 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 2058, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2127, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1762, independent: 1717, independent conditional: 0, independent unconditional: 1717, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1762, independent: 1703, independent conditional: 0, independent unconditional: 1703, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 276, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2127, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1762, unknown conditional: 0, unknown unconditional: 1762] , Statistics on independence cache: Total cache size (in pairs): 2598, Positive cache size: 2553, Positive conditional cache size: 0, Positive unconditional cache size: 2553, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 175, independent: 145, independent conditional: 22, independent unconditional: 123, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 145, independent conditional: 22, independent unconditional: 123, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 145, independent conditional: 22, independent unconditional: 123, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 162, independent: 137, independent conditional: 21, independent unconditional: 116, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 162, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 92, dependent conditional: 59, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 162, unknown conditional: 31, unknown unconditional: 131] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 137, Positive conditional cache size: 21, Positive unconditional cache size: 116, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 125, independent conditional: 17, independent unconditional: 108, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 156, Positive conditional cache size: 21, Positive unconditional cache size: 135, Negative cache size: 32, Negative conditional cache size: 10, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 120, independent conditional: 15, independent unconditional: 105, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 161, Positive conditional cache size: 21, Positive unconditional cache size: 140, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 116, independent conditional: 26, independent unconditional: 90, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 163, Positive conditional cache size: 21, Positive unconditional cache size: 142, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 56 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 82, independent conditional: 30, independent unconditional: 52, dependent: 37, dependent conditional: 26, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 169, Positive conditional cache size: 21, Positive unconditional cache size: 148, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 108, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 114, independent conditional: 32, independent unconditional: 82, dependent: 40, dependent conditional: 28, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 172, Positive conditional cache size: 21, Positive unconditional cache size: 151, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 144, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 67 PlacesBefore, 67 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 452, independent: 374, independent conditional: 374, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 452, independent: 374, independent conditional: 145, independent unconditional: 229, dependent: 78, dependent conditional: 4, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 452, independent: 374, independent conditional: 4, independent unconditional: 370, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 452, independent: 374, independent conditional: 4, independent unconditional: 370, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 452, independent: 358, independent conditional: 4, independent unconditional: 354, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 188, Positive conditional cache size: 21, Positive unconditional cache size: 167, Negative cache size: 42, Negative conditional cache size: 10, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 145, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 71 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 478, independent: 392, independent conditional: 392, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 478, independent: 392, independent conditional: 200, independent unconditional: 192, dependent: 86, dependent conditional: 4, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 392, independent conditional: 4, independent unconditional: 388, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 392, independent conditional: 4, independent unconditional: 388, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 387, independent conditional: 4, independent unconditional: 383, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 193, Positive conditional cache size: 21, Positive unconditional cache size: 172, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 204, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 157, independent: 123, independent conditional: 52, independent unconditional: 71, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 123, independent conditional: 12, independent unconditional: 111, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 123, independent conditional: 12, independent unconditional: 111, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 115, independent conditional: 10, independent unconditional: 105, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 201, Positive conditional cache size: 23, Positive unconditional cache size: 178, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 76 PlacesBefore, 76 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, independent: 239, independent conditional: 239, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, independent: 239, independent conditional: 127, independent unconditional: 112, dependent: 76, dependent conditional: 32, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 403, independent: 239, independent conditional: 2, independent unconditional: 237, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 403, independent: 239, independent conditional: 2, independent unconditional: 237, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 403, independent: 237, independent conditional: 2, independent unconditional: 235, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 203, Positive conditional cache size: 23, Positive unconditional cache size: 180, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 245, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 78 PlacesBefore, 75 PlacesAfterwards, 56 TransitionsBefore, 53 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 102, independent conditional: 34, independent unconditional: 68, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 233, Positive conditional cache size: 23, Positive unconditional cache size: 210, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 58 PlacesBefore, 53 PlacesAfterwards, 37 TransitionsBefore, 32 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 158, independent conditional: 158, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 200, independent: 158, independent conditional: 84, independent unconditional: 74, dependent: 42, dependent conditional: 1, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 158, independent conditional: 51, independent unconditional: 107, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 158, independent conditional: 51, independent unconditional: 107, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 134, independent conditional: 39, independent unconditional: 95, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 29, unknown conditional: 12, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 317, Positive conditional cache size: 39, Positive unconditional cache size: 278, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 321, Positive conditional cache size: 43, Positive unconditional cache size: 278, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-2, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-1, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=1, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 [L821] 4 __unbuffered_p3_EAX = z [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L871] 3 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L873] RET 3 assume_abort_if_not(main$tmp_guard0) [L875] 3 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 3 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 3 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L882] 3 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1154 IncrementalHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 34 mSDtfsCounter, 1154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1021occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:23:14,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...