/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:09:03,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:09:03,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:09:03,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:09:03,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:09:03,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:09:03,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:09:03,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:09:03,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:09:03,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:09:03,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:09:03,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:09:03,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:09:03,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:09:03,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:09:03,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:09:03,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:09:03,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:09:03,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:09:03,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:09:03,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:09:03,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:09:03,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:09:03,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:09:03,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:09:03,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:09:03,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:09:03,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:09:03,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:09:03,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:09:03,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:09:03,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:09:03,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:09:03,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:09:03,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:09:03,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:09:03,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:09:03,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:09:03,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:09:03,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:09:03,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:09:03,162 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:09:03,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:09:03,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:09:03,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:09:03,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:09:03,195 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:09:03,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:09:03,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:09:03,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:09:03,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:09:03,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:09:03,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:09:03,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:09:03,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:09:03,196 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:09:03,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:09:03,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:09:03,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:09:03,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:09:03,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:09:03,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:09:03,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:09:03,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:03,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:09:03,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:09:03,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:09:03,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:09:03,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:09:03,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:09:03,198 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 04:09:03,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:09:03,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:09:03,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:09:03,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:09:03,535 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:09:03,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-12-06 04:09:04,548 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:09:04,851 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:09:04,851 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-12-06 04:09:04,873 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b45f878f/04eebd6285884a759be3310b910eae85/FLAG9c31a90ef [2022-12-06 04:09:04,894 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b45f878f/04eebd6285884a759be3310b910eae85 [2022-12-06 04:09:04,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:09:04,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:09:04,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:04,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:09:04,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:09:04,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701d1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04, skipping insertion in model container [2022-12-06 04:09:04,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:09:04,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:09:05,125 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/mix017_pso.opt_tso.opt.i[956,969] [2022-12-06 04:09:05,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:05,364 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:09:05,376 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/mix017_pso.opt_tso.opt.i[956,969] [2022-12-06 04:09:05,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:05,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:05,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:05,457 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:09:05,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05 WrapperNode [2022-12-06 04:09:05,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:05,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:05,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:09:05,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:09:05,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,511 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-06 04:09:05,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:05,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:09:05,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:09:05,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:09:05,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:09:05,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:09:05,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:09:05,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:09:05,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (1/1) ... [2022-12-06 04:09:05,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:05,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:05,580 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 04:09:05,594 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 04:09:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:09:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:09:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:09:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:09:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:09:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:09:05,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:09:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:09:05,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:09:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:09:05,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:09:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:09:05,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:09:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:09:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:09:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:09:05,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:09:05,623 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 04:09:05,769 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:09:05,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:09:06,146 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:09:06,269 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:09:06,269 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:09:06,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:06 BoogieIcfgContainer [2022-12-06 04:09:06,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:09:06,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:09:06,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:09:06,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:09:06,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:09:04" (1/3) ... [2022-12-06 04:09:06,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60963d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:06, skipping insertion in model container [2022-12-06 04:09:06,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:05" (2/3) ... [2022-12-06 04:09:06,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60963d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:06, skipping insertion in model container [2022-12-06 04:09:06,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:06" (3/3) ... [2022-12-06 04:09:06,279 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-12-06 04:09:06,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:09:06,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:09:06,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:09:06,351 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:09:06,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:09:06,456 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:09:06,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:06,462 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 62 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 04:09:06,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:09:06,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:06,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:06,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:06,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:06,563 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:09:06,564 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:06,568 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 62 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 04:09:06,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:06,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-06 04:09:11,460 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 04:09:11,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:09:11,478 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;@293c5d3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:09:11,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:09:11,483 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 04:09:11,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:11,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:11,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:11,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -510420395, now seen corresponding path program 1 times [2022-12-06 04:09:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223410256] [2022-12-06 04:09:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:11,956 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 04:09:11,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:11,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223410256] [2022-12-06 04:09:11,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223410256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:11,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:11,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883417546] [2022-12-06 04:09:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:11,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:11,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 04:09:11,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 04:09:11,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:11,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 04:09:11,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:12,610 INFO L130 PetriNetUnfolder]: 3113/4511 cut-off events. [2022-12-06 04:09:12,610 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 04:09:12,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4511 events. 3113/4511 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23841 event pairs, 593 based on Foata normal form. 0/4147 useless extension candidates. Maximal degree in co-relation 8893. Up to 3385 conditions per place. [2022-12-06 04:09:12,641 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 30 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 04:09:12,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2022-12-06 04:09:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:09:12,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:09:12,653 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:09:12,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2022-12-06 04:09:12,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:12,659 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 04:09:12,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:09:12,665 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 04:09:12,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:12,666 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 04:09:12,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:12,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:12,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 04:09:12,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 04:09:12,675 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:09:12,675 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:12,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:09:12,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 04:09:12,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:09:12,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:12,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 04:09:12,803 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-06 04:09:12,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 04:09:12,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:12,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:12,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:09:12,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash -887663660, now seen corresponding path program 1 times [2022-12-06 04:09:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807510539] [2022-12-06 04:09:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:13,033 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 04:09:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:13,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807510539] [2022-12-06 04:09:13,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807510539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:13,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:13,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608911525] [2022-12-06 04:09:13,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:13,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:13,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:13,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:13,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:09:13,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 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 04:09:13,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:13,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:09:13,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:13,698 INFO L130 PetriNetUnfolder]: 4631/6320 cut-off events. [2022-12-06 04:09:13,698 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-06 04:09:13,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13062 conditions, 6320 events. 4631/6320 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27191 event pairs, 1783 based on Foata normal form. 16/6336 useless extension candidates. Maximal degree in co-relation 13052. Up to 6129 conditions per place. [2022-12-06 04:09:13,731 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 04:09:13,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 184 flow [2022-12-06 04:09:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 04:09:13,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 04:09:13,733 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 42 transitions. [2022-12-06 04:09:13,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 184 flow [2022-12-06 04:09:13,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:13,735 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 91 flow [2022-12-06 04:09:13,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-06 04:09:13,736 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2022-12-06 04:09:13,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:13,736 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 91 flow [2022-12-06 04:09:13,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:13,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:13,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 91 flow [2022-12-06 04:09:13,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 91 flow [2022-12-06 04:09:13,753 INFO L130 PetriNetUnfolder]: 45/137 cut-off events. [2022-12-06 04:09:13,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:13,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 137 events. 45/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 555 event pairs, 23 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 220. Up to 76 conditions per place. [2022-12-06 04:09:13,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 91 flow [2022-12-06 04:09:13,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 04:09:13,783 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:13,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 04:09:13,784 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 91 flow [2022-12-06 04:09:13,784 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 04:09:13,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:13,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:13,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:09:13,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash -409409733, now seen corresponding path program 1 times [2022-12-06 04:09:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:13,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757549743] [2022-12-06 04:09:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:13,886 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 04:09:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757549743] [2022-12-06 04:09:13,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757549743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:13,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:13,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561965586] [2022-12-06 04:09:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:13,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:13,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:09:13,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 04:09:13,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:13,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:09:13,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:14,338 INFO L130 PetriNetUnfolder]: 2868/4223 cut-off events. [2022-12-06 04:09:14,338 INFO L131 PetriNetUnfolder]: For 462/462 co-relation queries the response was YES. [2022-12-06 04:09:14,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9193 conditions, 4223 events. 2868/4223 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21277 event pairs, 1071 based on Foata normal form. 100/4218 useless extension candidates. Maximal degree in co-relation 9182. Up to 2547 conditions per place. [2022-12-06 04:09:14,367 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 30 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2022-12-06 04:09:14,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 177 flow [2022-12-06 04:09:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 04:09:14,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 04:09:14,370 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 91 flow. Second operand 3 states and 41 transitions. [2022-12-06 04:09:14,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 177 flow [2022-12-06 04:09:14,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:14,372 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 97 flow [2022-12-06 04:09:14,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-06 04:09:14,374 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-06 04:09:14,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:14,374 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 97 flow [2022-12-06 04:09:14,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:14,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:14,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 97 flow [2022-12-06 04:09:14,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 97 flow [2022-12-06 04:09:14,387 INFO L130 PetriNetUnfolder]: 29/89 cut-off events. [2022-12-06 04:09:14,388 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 04:09:14,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 89 events. 29/89 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 312 event pairs, 11 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 169. Up to 53 conditions per place. [2022-12-06 04:09:14,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 97 flow [2022-12-06 04:09:14,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 04:09:14,393 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:14,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 04:09:14,394 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 97 flow [2022-12-06 04:09:14,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 04:09:14,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:14,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:14,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:09:14,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:14,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1652523397, now seen corresponding path program 1 times [2022-12-06 04:09:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:14,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726098764] [2022-12-06 04:09:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:14,584 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 04:09:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:14,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726098764] [2022-12-06 04:09:14,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726098764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:14,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003701288] [2022-12-06 04:09:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:14,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:09:14,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 6.25) 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 04:09:14,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:14,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:09:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:15,044 INFO L130 PetriNetUnfolder]: 2654/3960 cut-off events. [2022-12-06 04:09:15,045 INFO L131 PetriNetUnfolder]: For 1103/1103 co-relation queries the response was YES. [2022-12-06 04:09:15,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9299 conditions, 3960 events. 2654/3960 cut-off events. For 1103/1103 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20688 event pairs, 521 based on Foata normal form. 296/4148 useless extension candidates. Maximal degree in co-relation 9286. Up to 2616 conditions per place. [2022-12-06 04:09:15,071 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 55 selfloop transitions, 9 changer transitions 2/71 dead transitions. [2022-12-06 04:09:15,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 347 flow [2022-12-06 04:09:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 04:09:15,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632 [2022-12-06 04:09:15,073 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 97 flow. Second operand 5 states and 79 transitions. [2022-12-06 04:09:15,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 347 flow [2022-12-06 04:09:15,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 71 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:15,076 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 160 flow [2022-12-06 04:09:15,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-06 04:09:15,077 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 04:09:15,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:15,077 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 160 flow [2022-12-06 04:09:15,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:15,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:15,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 160 flow [2022-12-06 04:09:15,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 160 flow [2022-12-06 04:09:15,118 INFO L130 PetriNetUnfolder]: 249/490 cut-off events. [2022-12-06 04:09:15,118 INFO L131 PetriNetUnfolder]: For 267/335 co-relation queries the response was YES. [2022-12-06 04:09:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 490 events. 249/490 cut-off events. For 267/335 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2710 event pairs, 119 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 1334. Up to 311 conditions per place. [2022-12-06 04:09:15,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 160 flow [2022-12-06 04:09:15,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 04:09:15,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L873-3-->L877: Formula: (and (= v_~main$tmp_guard0~0_46 (ite (= (ite (= v_~__unbuffered_cnt~0_141 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [521] L849-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res#1.offset_27| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P3Thread1of1ForFork1_#res#1.base_27| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{P3Thread1of1ForFork1_#res#1.offset=|v_P3Thread1of1ForFork1_#res#1.offset_27|, P3Thread1of1ForFork1_#res#1.base=|v_P3Thread1of1ForFork1_#res#1.base_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res#1.offset, P3Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 04:09:15,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L873-3-->L877: Formula: (and (= v_~main$tmp_guard0~0_46 (ite (= (ite (= v_~__unbuffered_cnt~0_141 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [449] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_11| 0) (= |v_P2Thread1of1ForFork3_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_11|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-06 04:09:15,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L873-3-->L877: Formula: (and (= v_~main$tmp_guard0~0_46 (ite (= (ite (= v_~__unbuffered_cnt~0_141 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [440] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 04:09:15,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:15,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 04:09:15,247 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 166 flow [2022-12-06 04:09:15,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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 04:09:15,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:15,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:15,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:09:15,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2073991876, now seen corresponding path program 1 times [2022-12-06 04:09:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:15,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66498824] [2022-12-06 04:09:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:15,451 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 04:09:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66498824] [2022-12-06 04:09:15,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66498824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:15,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:15,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194663822] [2022-12-06 04:09:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:15,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:15,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:15,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:09:15,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 04:09:15,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:15,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:09:15,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:15,889 INFO L130 PetriNetUnfolder]: 1810/2850 cut-off events. [2022-12-06 04:09:15,890 INFO L131 PetriNetUnfolder]: For 2185/2204 co-relation queries the response was YES. [2022-12-06 04:09:15,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8999 conditions, 2850 events. 1810/2850 cut-off events. For 2185/2204 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15072 event pairs, 237 based on Foata normal form. 223/2999 useless extension candidates. Maximal degree in co-relation 8983. Up to 1187 conditions per place. [2022-12-06 04:09:15,909 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 64 selfloop transitions, 16 changer transitions 2/87 dead transitions. [2022-12-06 04:09:15,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 87 transitions, 512 flow [2022-12-06 04:09:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-06 04:09:15,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 04:09:15,913 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 166 flow. Second operand 6 states and 100 transitions. [2022-12-06 04:09:15,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 87 transitions, 512 flow [2022-12-06 04:09:15,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 501 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:15,920 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 274 flow [2022-12-06 04:09:15,921 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-06 04:09:15,923 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 04:09:15,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:15,923 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 274 flow [2022-12-06 04:09:15,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:15,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:15,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 274 flow [2022-12-06 04:09:15,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 274 flow [2022-12-06 04:09:15,963 INFO L130 PetriNetUnfolder]: 165/387 cut-off events. [2022-12-06 04:09:15,963 INFO L131 PetriNetUnfolder]: For 916/1065 co-relation queries the response was YES. [2022-12-06 04:09:15,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 387 events. 165/387 cut-off events. For 916/1065 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2165 event pairs, 38 based on Foata normal form. 11/369 useless extension candidates. Maximal degree in co-relation 1593. Up to 277 conditions per place. [2022-12-06 04:09:15,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 274 flow [2022-12-06 04:09:15,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 04:09:16,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:16,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 04:09:16,048 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 266 flow [2022-12-06 04:09:16,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 04:09:16,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:16,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:16,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:09:16,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1986967255, now seen corresponding path program 1 times [2022-12-06 04:09:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:16,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352396993] [2022-12-06 04:09:16,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:16,238 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 04:09:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:16,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352396993] [2022-12-06 04:09:16,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352396993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:16,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:16,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971969471] [2022-12-06 04:09:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:16,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:16,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:09:16,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 04:09:16,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:16,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:09:16,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:16,602 INFO L130 PetriNetUnfolder]: 1142/1853 cut-off events. [2022-12-06 04:09:16,603 INFO L131 PetriNetUnfolder]: For 3658/3692 co-relation queries the response was YES. [2022-12-06 04:09:16,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6728 conditions, 1853 events. 1142/1853 cut-off events. For 3658/3692 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9293 event pairs, 182 based on Foata normal form. 109/1909 useless extension candidates. Maximal degree in co-relation 6708. Up to 746 conditions per place. [2022-12-06 04:09:16,615 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 71 selfloop transitions, 23 changer transitions 11/110 dead transitions. [2022-12-06 04:09:16,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 110 transitions, 752 flow [2022-12-06 04:09:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:09:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:09:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-06 04:09:16,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5758928571428571 [2022-12-06 04:09:16,616 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 266 flow. Second operand 8 states and 129 transitions. [2022-12-06 04:09:16,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 110 transitions, 752 flow [2022-12-06 04:09:16,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 706 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:16,637 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 377 flow [2022-12-06 04:09:16,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=377, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-12-06 04:09:16,638 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-06 04:09:16,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:16,638 INFO L89 Accepts]: Start accepts. Operand has 57 places, 51 transitions, 377 flow [2022-12-06 04:09:16,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:16,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:16,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 377 flow [2022-12-06 04:09:16,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 377 flow [2022-12-06 04:09:16,662 INFO L130 PetriNetUnfolder]: 85/236 cut-off events. [2022-12-06 04:09:16,662 INFO L131 PetriNetUnfolder]: For 764/786 co-relation queries the response was YES. [2022-12-06 04:09:16,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 236 events. 85/236 cut-off events. For 764/786 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1167 event pairs, 10 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 1010. Up to 118 conditions per place. [2022-12-06 04:09:16,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 377 flow [2022-12-06 04:09:16,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-06 04:09:16,697 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:16,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 04:09:16,698 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 367 flow [2022-12-06 04:09:16,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 04:09:16,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:16,699 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] [2022-12-06 04:09:16,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:09:16,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2027452080, now seen corresponding path program 1 times [2022-12-06 04:09:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:16,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7599359] [2022-12-06 04:09:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:16,884 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 04:09:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7599359] [2022-12-06 04:09:16,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7599359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:16,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:16,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185827325] [2022-12-06 04:09:16,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:16,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:16,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:16,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:16,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:16,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:09:16,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 367 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:09:16,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:16,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:09:16,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:17,311 INFO L130 PetriNetUnfolder]: 2032/3079 cut-off events. [2022-12-06 04:09:17,311 INFO L131 PetriNetUnfolder]: For 6639/6639 co-relation queries the response was YES. [2022-12-06 04:09:17,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11058 conditions, 3079 events. 2032/3079 cut-off events. For 6639/6639 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14598 event pairs, 100 based on Foata normal form. 10/3089 useless extension candidates. Maximal degree in co-relation 11036. Up to 1869 conditions per place. [2022-12-06 04:09:17,331 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 87 selfloop transitions, 14 changer transitions 25/126 dead transitions. [2022-12-06 04:09:17,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 1150 flow [2022-12-06 04:09:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 04:09:17,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:09:17,333 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 367 flow. Second operand 5 states and 80 transitions. [2022-12-06 04:09:17,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 1150 flow [2022-12-06 04:09:17,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 922 flow, removed 82 selfloop flow, removed 5 redundant places. [2022-12-06 04:09:17,370 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 307 flow [2022-12-06 04:09:17,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-06 04:09:17,371 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-06 04:09:17,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:17,372 INFO L89 Accepts]: Start accepts. Operand has 59 places, 50 transitions, 307 flow [2022-12-06 04:09:17,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:17,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:17,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 307 flow [2022-12-06 04:09:17,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 50 transitions, 307 flow [2022-12-06 04:09:17,407 INFO L130 PetriNetUnfolder]: 152/367 cut-off events. [2022-12-06 04:09:17,407 INFO L131 PetriNetUnfolder]: For 470/502 co-relation queries the response was YES. [2022-12-06 04:09:17,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 367 events. 152/367 cut-off events. For 470/502 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1883 event pairs, 14 based on Foata normal form. 3/352 useless extension candidates. Maximal degree in co-relation 1194. Up to 131 conditions per place. [2022-12-06 04:09:17,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 50 transitions, 307 flow [2022-12-06 04:09:17,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-06 04:09:17,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:17,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 04:09:17,415 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 307 flow [2022-12-06 04:09:17,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:09:17,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:17,416 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] [2022-12-06 04:09:17,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:09:17,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -447169322, now seen corresponding path program 2 times [2022-12-06 04:09:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:17,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032575140] [2022-12-06 04:09:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:17,604 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 04:09:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032575140] [2022-12-06 04:09:17,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032575140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:17,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:17,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006281000] [2022-12-06 04:09:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:17,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:17,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:17,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:09:17,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 307 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:09:17,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:17,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:09:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:18,044 INFO L130 PetriNetUnfolder]: 2093/3253 cut-off events. [2022-12-06 04:09:18,044 INFO L131 PetriNetUnfolder]: For 5227/5227 co-relation queries the response was YES. [2022-12-06 04:09:18,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12034 conditions, 3253 events. 2093/3253 cut-off events. For 5227/5227 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16106 event pairs, 317 based on Foata normal form. 10/3263 useless extension candidates. Maximal degree in co-relation 12010. Up to 1816 conditions per place. [2022-12-06 04:09:18,064 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 79 selfloop transitions, 14 changer transitions 35/128 dead transitions. [2022-12-06 04:09:18,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 128 transitions, 971 flow [2022-12-06 04:09:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-06 04:09:18,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 04:09:18,065 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 307 flow. Second operand 6 states and 85 transitions. [2022-12-06 04:09:18,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 128 transitions, 971 flow [2022-12-06 04:09:18,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 128 transitions, 955 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:18,093 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 366 flow [2022-12-06 04:09:18,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-06 04:09:18,093 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-06 04:09:18,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:18,094 INFO L89 Accepts]: Start accepts. Operand has 59 places, 54 transitions, 366 flow [2022-12-06 04:09:18,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:18,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:18,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 366 flow [2022-12-06 04:09:18,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 366 flow [2022-12-06 04:09:18,142 INFO L130 PetriNetUnfolder]: 231/558 cut-off events. [2022-12-06 04:09:18,142 INFO L131 PetriNetUnfolder]: For 828/894 co-relation queries the response was YES. [2022-12-06 04:09:18,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 558 events. 231/558 cut-off events. For 828/894 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3350 event pairs, 27 based on Foata normal form. 5/527 useless extension candidates. Maximal degree in co-relation 1827. Up to 217 conditions per place. [2022-12-06 04:09:18,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 366 flow [2022-12-06 04:09:18,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-06 04:09:18,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L770: Formula: (and (= v_~x~0_11 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [399] L823-->L839: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd4~0_67 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_128 256) 0)) (.cse8 (and .cse3 (= (mod v_~z$w_buff1_used~0_117 256) 0))) (.cse1 (and .cse7 .cse3))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_116 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_127 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_56 256) 0))) (.cse9 (or .cse11 .cse8 .cse1)) (.cse10 (and (not .cse11) .cse5))) (and (= v_~weak$$choice2~0_56 |v_P3Thread1of1ForFork1_#t~nondet6#1_1|) (= (ite .cse0 v_~z$r_buff0_thd4~0_67 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd4~0_67 (ite (and (not .cse2) .cse5) 0 v_~z$r_buff0_thd4~0_67))) v_~z$r_buff0_thd4~0_66) (= v_~z$mem_tmp~0_34 v_~z~0_109) (= (ite .cse0 v_~z$mem_tmp~0_34 v_~__unbuffered_p3_EAX~0_12) v_~z~0_108) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd4~0_66 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse6 .cse4))) v_~z$r_buff1_thd4~0_60 0)) v_~z$r_buff1_thd4~0_59) (= (ite .cse0 v_~z$w_buff1_used~0_117 (ite (or .cse8 .cse1 .cse2) v_~z$w_buff1_used~0_117 0)) v_~z$w_buff1_used~0_116) (= v_~z$w_buff0~0_80 v_~z$w_buff0~0_81) (= v_~z$w_buff0_used~0_127 (ite .cse0 v_~z$w_buff0_used~0_128 (ite .cse9 v_~z$w_buff0_used~0_128 (ite .cse10 0 v_~z$w_buff0_used~0_128)))) (= v_~z$w_buff1~0_69 v_~z$w_buff1~0_70) (= (ite .cse9 v_~z~0_109 (ite .cse10 v_~z$w_buff0~0_81 v_~z$w_buff1~0_70)) v_~__unbuffered_p3_EAX~0_12) (= v_~weak$$choice0~0_14 |v_P3Thread1of1ForFork1_#t~nondet5#1_1|))))) InVars {P3Thread1of1ForFork1_#t~nondet5#1=|v_P3Thread1of1ForFork1_#t~nondet5#1_1|, P3Thread1of1ForFork1_#t~nondet6#1=|v_P3Thread1of1ForFork1_#t~nondet6#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z~0=v_~z~0_109} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_34, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_80, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_66, ~z~0=v_~z~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_56} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#t~nondet6#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-06 04:09:18,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L770: Formula: (and (= v_~x~0_11 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [399] L823-->L839: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd4~0_67 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_128 256) 0)) (.cse8 (and .cse3 (= (mod v_~z$w_buff1_used~0_117 256) 0))) (.cse1 (and .cse7 .cse3))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_116 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_127 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_56 256) 0))) (.cse9 (or .cse11 .cse8 .cse1)) (.cse10 (and (not .cse11) .cse5))) (and (= v_~weak$$choice2~0_56 |v_P3Thread1of1ForFork1_#t~nondet6#1_1|) (= (ite .cse0 v_~z$r_buff0_thd4~0_67 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd4~0_67 (ite (and (not .cse2) .cse5) 0 v_~z$r_buff0_thd4~0_67))) v_~z$r_buff0_thd4~0_66) (= v_~z$mem_tmp~0_34 v_~z~0_109) (= (ite .cse0 v_~z$mem_tmp~0_34 v_~__unbuffered_p3_EAX~0_12) v_~z~0_108) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd4~0_66 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse6 .cse4))) v_~z$r_buff1_thd4~0_60 0)) v_~z$r_buff1_thd4~0_59) (= (ite .cse0 v_~z$w_buff1_used~0_117 (ite (or .cse8 .cse1 .cse2) v_~z$w_buff1_used~0_117 0)) v_~z$w_buff1_used~0_116) (= v_~z$w_buff0~0_80 v_~z$w_buff0~0_81) (= v_~z$w_buff0_used~0_127 (ite .cse0 v_~z$w_buff0_used~0_128 (ite .cse9 v_~z$w_buff0_used~0_128 (ite .cse10 0 v_~z$w_buff0_used~0_128)))) (= v_~z$w_buff1~0_69 v_~z$w_buff1~0_70) (= (ite .cse9 v_~z~0_109 (ite .cse10 v_~z$w_buff0~0_81 v_~z$w_buff1~0_70)) v_~__unbuffered_p3_EAX~0_12) (= v_~weak$$choice0~0_14 |v_P3Thread1of1ForFork1_#t~nondet5#1_1|))))) InVars {P3Thread1of1ForFork1_#t~nondet5#1=|v_P3Thread1of1ForFork1_#t~nondet5#1_1|, P3Thread1of1ForFork1_#t~nondet6#1=|v_P3Thread1of1ForFork1_#t~nondet6#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z~0=v_~z~0_109} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_34, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_80, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_66, ~z~0=v_~z~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_56} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#t~nondet6#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-06 04:09:18,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L770: Formula: (and (= v_~x~0_11 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [392] L785-->L801: Formula: (let ((.cse11 (= (mod v_~z$r_buff1_thd3~0_38 256) 0)) (.cse2 (= (mod v_~z$r_buff0_thd3~0_38 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse2 .cse11)) (.cse12 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse6 (and .cse2 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse3 .cse12 .cse6)) (.cse8 (and (not .cse12) .cse5))) (let ((.cse9 (ite .cse7 v_~z~0_95 (ite .cse8 v_~z$w_buff0~0_65 v_~z$w_buff1~0_56))) (.cse0 (not (= (mod v_~weak$$choice2~0_50 256) 0))) (.cse1 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= v_~z$r_buff0_thd3~0_37 (ite .cse0 v_~z$r_buff0_thd3~0_38 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~z$r_buff0_thd3~0_38 (ite (and (not .cse4) .cse5) 0 v_~z$r_buff0_thd3~0_38)))) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_12) (= (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse3 .cse4 .cse6) v_~z$w_buff1_used~0_103 0)) v_~z$w_buff1_used~0_102) (= v_~z$w_buff0_used~0_111 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse7 v_~z$w_buff0_used~0_112 (ite .cse8 0 v_~z$w_buff0_used~0_112)))) (= v_~z$flush_delayed~0_40 0) (= (ite .cse0 v_~z$mem_tmp~0_28 .cse9) v_~z~0_94) (= .cse9 v_~__unbuffered_p2_EAX~0_10) (= v_~z$mem_tmp~0_28 v_~z~0_95) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_50) (= (ite .cse0 v_~z$r_buff1_thd3~0_38 (ite (let ((.cse10 (= (mod v_~z$r_buff0_thd3~0_37 256) 0))) (or (and .cse10 .cse11) (and .cse1 .cse10) .cse4)) v_~z$r_buff1_thd3~0_38 0)) v_~z$r_buff1_thd3~0_37) (= v_~z$w_buff0~0_65 v_~z$w_buff0~0_64)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_65, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z$w_buff1~0=v_~z$w_buff1~0_56, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_28, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_50} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] [2022-12-06 04:09:18,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L755-->L758: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] and [386] L770-->L773: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 04:09:18,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L839: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd4~0_175 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd4~0_209 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_358 256) 0)) (.cse4 (and .cse9 .cse3)) (.cse6 (and (= (mod v_~z$w_buff1_used~0_317 256) 0) .cse3))) (let ((.cse1 (= (mod v_~z$w_buff0_used~0_357 256) 0)) (.cse2 (= (mod v_~z$w_buff1_used~0_316 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_114 256) 0))) (.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11)))) (and (= v_~z$r_buff0_thd4~0_208 (ite .cse0 v_~z$r_buff0_thd4~0_209 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~z$r_buff0_thd4~0_209 (ite (and .cse5 (not .cse1)) 0 v_~z$r_buff0_thd4~0_209)))) (= (ite .cse0 v_~z$mem_tmp~0_102 v_~__unbuffered_p3_EAX~0_74) v_~z~0_299) (= v_~z$w_buff1_used~0_316 (ite .cse0 v_~z$w_buff1_used~0_317 (ite (or .cse1 .cse4 .cse6) v_~z$w_buff1_used~0_317 0))) (= v_~z$w_buff0~0_251 v_~z$w_buff0~0_250) (= v_~z$flush_delayed~0_116 0) (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= (ite .cse7 v_~z~0_300 (ite .cse8 v_~z$w_buff0~0_251 v_~z$w_buff1~0_213)) v_~__unbuffered_p3_EAX~0_74) (= v_~x~0_49 1) (= v_~weak$$choice2~0_114 |v_P3Thread1of1ForFork1_#t~nondet6#1_38|) (= v_~weak$$choice0~0_70 |v_P3Thread1of1ForFork1_#t~nondet5#1_38|) (= v_~z$w_buff1~0_213 v_~z$w_buff1~0_212) (= (ite .cse0 v_~z$r_buff1_thd4~0_175 (ite (let ((.cse10 (= (mod v_~z$r_buff0_thd4~0_208 256) 0))) (or (and .cse9 .cse10) .cse1 (and .cse2 .cse10))) v_~z$r_buff1_thd4~0_175 0)) v_~z$r_buff1_thd4~0_174) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17) (= v_~z~0_300 v_~z$mem_tmp~0_102) (= v_~z$w_buff0_used~0_357 (ite .cse0 v_~z$w_buff0_used~0_358 (ite .cse7 v_~z$w_buff0_used~0_358 (ite .cse8 0 v_~z$w_buff0_used~0_358)))))))) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P3Thread1of1ForFork1_#t~nondet5#1=|v_P3Thread1of1ForFork1_#t~nondet5#1_38|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, P3Thread1of1ForFork1_#t~nondet6#1=|v_P3Thread1of1ForFork1_#t~nondet6#1_38|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_358, ~z$w_buff0~0=v_~z$w_buff0~0_251, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_317, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_209, ~z$w_buff1~0=v_~z$w_buff1~0_213, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~z~0=v_~z~0_300} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_102, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_174, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_357, ~z$w_buff0~0=v_~z$w_buff0~0_250, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_316, ~z$w_buff1~0=v_~z$w_buff1~0_212, ~z$flush_delayed~0=v_~z$flush_delayed~0_116, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, ~weak$$choice0~0=v_~weak$$choice0~0_70, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_208, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~z~0=v_~z~0_299, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, P1Thread1of1ForFork2_~arg.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#t~nondet6#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork1_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0, ~x~0] and [386] L770-->L773: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 04:09:19,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] $Ultimate##0-->L801: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_136 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_135 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 .cse9)) (.cse5 (and .cse10 (= (mod v_~z$w_buff1_used~0_321 256) 0))) (.cse12 (= (mod v_~z$w_buff0_used~0_362 256) 0))) (let ((.cse2 (or .cse4 .cse5 .cse12)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_304 (ite .cse3 v_~z$w_buff0~0_255 v_~z$w_buff1~0_217))) (.cse0 (not (= (mod v_~weak$$choice2~0_116 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_320 256) 0)) (.cse6 (= (mod v_~z$w_buff0_used~0_361 256) 0))) (and (= v_~z~0_303 (ite .cse0 v_~z$mem_tmp~0_104 .cse1)) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~z$w_buff1~0_217 v_~z$w_buff1~0_216) (= v_~z$w_buff0_used~0_361 (ite .cse0 v_~z$w_buff0_used~0_362 (ite .cse2 v_~z$w_buff0_used~0_362 (ite .cse3 0 v_~z$w_buff0_used~0_362)))) (= |v_P2Thread1of1ForFork3_#t~nondet3_66| v_~weak$$choice0~0_72) (= (ite .cse0 v_~z$w_buff1_used~0_321 (ite (or .cse4 .cse5 .cse6) v_~z$w_buff1_used~0_321 0)) v_~z$w_buff1_used~0_320) (= v_~x~0_51 1) (= (ite .cse0 v_~z$r_buff1_thd3~0_136 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_134 256) 0))) (or (and .cse7 .cse8) .cse6 (and .cse8 .cse9))) v_~z$r_buff1_thd3~0_136 0)) v_~z$r_buff1_thd3~0_135) (= .cse1 v_~__unbuffered_p2_EAX~0_88) (= (ite .cse0 v_~z$r_buff0_thd3~0_135 (ite (or .cse4 .cse6 (and .cse10 .cse7)) v_~z$r_buff0_thd3~0_135 (ite (and .cse11 (not .cse6)) 0 v_~z$r_buff0_thd3~0_135))) v_~z$r_buff0_thd3~0_134) (= v_~z$flush_delayed~0_118 0) (= v_~z~0_304 v_~z$mem_tmp~0_104) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19) (= |v_P2Thread1of1ForFork3_#t~nondet4_66| v_~weak$$choice2~0_116) (= v_~z$w_buff0~0_255 v_~z$w_buff0~0_254)))))) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_362, ~z$w_buff0~0=v_~z$w_buff0~0_255, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_66|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_321, ~z$w_buff1~0=v_~z$w_buff1~0_217, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_135, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_66|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~z~0=v_~z~0_304} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_104, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_361, ~z$w_buff0~0=v_~z$w_buff0~0_254, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_135, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_320, ~z$w_buff1~0=v_~z$w_buff1~0_216, ~z$flush_delayed~0=v_~z$flush_delayed~0_118, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_72, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_134, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~z~0=v_~z~0_303, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[~z$mem_tmp~0, P1Thread1of1ForFork2_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, ~x~0] and [386] L770-->L773: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 04:09:19,250 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:19,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1158 [2022-12-06 04:09:19,251 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 370 flow [2022-12-06 04:09:19,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:09:19,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:19,251 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] [2022-12-06 04:09:19,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:09:19,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash 859830066, now seen corresponding path program 3 times [2022-12-06 04:09:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:19,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452293144] [2022-12-06 04:09:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:19,458 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 04:09:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:19,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452293144] [2022-12-06 04:09:19,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452293144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:19,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:19,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:09:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715581426] [2022-12-06 04:09:19,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:19,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:09:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:09:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:09:19,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 04:09:19,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 04:09:19,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:19,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 04:09:19,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:19,866 INFO L130 PetriNetUnfolder]: 1428/2316 cut-off events. [2022-12-06 04:09:19,866 INFO L131 PetriNetUnfolder]: For 4225/4478 co-relation queries the response was YES. [2022-12-06 04:09:19,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8444 conditions, 2316 events. 1428/2316 cut-off events. For 4225/4478 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12653 event pairs, 191 based on Foata normal form. 147/2389 useless extension candidates. Maximal degree in co-relation 8418. Up to 833 conditions per place. [2022-12-06 04:09:19,878 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 60 selfloop transitions, 18 changer transitions 21/105 dead transitions. [2022-12-06 04:09:19,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 105 transitions, 822 flow [2022-12-06 04:09:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:09:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:09:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-06 04:09:19,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2022-12-06 04:09:19,879 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 370 flow. Second operand 8 states and 110 transitions. [2022-12-06 04:09:19,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 105 transitions, 822 flow [2022-12-06 04:09:19,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 773 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:19,910 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 327 flow [2022-12-06 04:09:19,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2022-12-06 04:09:19,910 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2022-12-06 04:09:19,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:19,911 INFO L89 Accepts]: Start accepts. Operand has 66 places, 47 transitions, 327 flow [2022-12-06 04:09:19,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:19,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:19,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 47 transitions, 327 flow [2022-12-06 04:09:19,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 47 transitions, 327 flow [2022-12-06 04:09:19,937 INFO L130 PetriNetUnfolder]: 108/283 cut-off events. [2022-12-06 04:09:19,937 INFO L131 PetriNetUnfolder]: For 529/579 co-relation queries the response was YES. [2022-12-06 04:09:19,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 283 events. 108/283 cut-off events. For 529/579 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1429 event pairs, 6 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 1071. Up to 105 conditions per place. [2022-12-06 04:09:19,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 47 transitions, 327 flow [2022-12-06 04:09:19,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 04:09:19,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L785-->L801: Formula: (let ((.cse11 (= (mod v_~z$r_buff1_thd3~0_38 256) 0)) (.cse2 (= (mod v_~z$r_buff0_thd3~0_38 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse2 .cse11)) (.cse12 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse6 (and .cse2 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse3 .cse12 .cse6)) (.cse8 (and (not .cse12) .cse5))) (let ((.cse9 (ite .cse7 v_~z~0_95 (ite .cse8 v_~z$w_buff0~0_65 v_~z$w_buff1~0_56))) (.cse0 (not (= (mod v_~weak$$choice2~0_50 256) 0))) (.cse1 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= v_~z$r_buff0_thd3~0_37 (ite .cse0 v_~z$r_buff0_thd3~0_38 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~z$r_buff0_thd3~0_38 (ite (and (not .cse4) .cse5) 0 v_~z$r_buff0_thd3~0_38)))) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_12) (= (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse3 .cse4 .cse6) v_~z$w_buff1_used~0_103 0)) v_~z$w_buff1_used~0_102) (= v_~z$w_buff0_used~0_111 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse7 v_~z$w_buff0_used~0_112 (ite .cse8 0 v_~z$w_buff0_used~0_112)))) (= v_~z$flush_delayed~0_40 0) (= (ite .cse0 v_~z$mem_tmp~0_28 .cse9) v_~z~0_94) (= .cse9 v_~__unbuffered_p2_EAX~0_10) (= v_~z$mem_tmp~0_28 v_~z~0_95) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_50) (= (ite .cse0 v_~z$r_buff1_thd3~0_38 (ite (let ((.cse10 (= (mod v_~z$r_buff0_thd3~0_37 256) 0))) (or (and .cse10 .cse11) (and .cse1 .cse10) .cse4)) v_~z$r_buff1_thd3~0_38 0)) v_~z$r_buff1_thd3~0_37) (= v_~z$w_buff0~0_65 v_~z$w_buff0~0_64)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_65, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z$w_buff1~0=v_~z$w_buff1~0_56, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_28, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_50} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] and [540] $Ultimate##0-->L773: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_29| v_P1Thread1of1ForFork2_~arg.base_29) (= v_~y~0_52 v_~__unbuffered_p1_EAX~0_73) (= v_~x~0_63 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_29| v_P1Thread1of1ForFork2_~arg.offset_29)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_29|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_29|, ~y~0=v_~y~0_52} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_29|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_29, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_29|, ~y~0=v_~y~0_52, ~x~0=v_~x~0_63} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~x~0] [2022-12-06 04:09:20,553 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:09:20,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-06 04:09:20,555 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 315 flow [2022-12-06 04:09:20,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 04:09:20,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:20,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] [2022-12-06 04:09:20,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:09:20,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1810307458, now seen corresponding path program 1 times [2022-12-06 04:09:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:20,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781005233] [2022-12-06 04:09:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:20,779 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 04:09:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:20,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781005233] [2022-12-06 04:09:20,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781005233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:20,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764259683] [2022-12-06 04:09:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:20,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:09:20,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 6.25) 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 04:09:20,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:20,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:09:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:21,012 INFO L130 PetriNetUnfolder]: 1036/1704 cut-off events. [2022-12-06 04:09:21,013 INFO L131 PetriNetUnfolder]: For 5330/5330 co-relation queries the response was YES. [2022-12-06 04:09:21,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7198 conditions, 1704 events. 1036/1704 cut-off events. For 5330/5330 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8370 event pairs, 206 based on Foata normal form. 1/1705 useless extension candidates. Maximal degree in co-relation 7169. Up to 1040 conditions per place. [2022-12-06 04:09:21,022 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 39 selfloop transitions, 1 changer transitions 53/94 dead transitions. [2022-12-06 04:09:21,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 866 flow [2022-12-06 04:09:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 04:09:21,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2022-12-06 04:09:21,023 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 315 flow. Second operand 4 states and 55 transitions. [2022-12-06 04:09:21,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 866 flow [2022-12-06 04:09:21,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 723 flow, removed 30 selfloop flow, removed 10 redundant places. [2022-12-06 04:09:21,042 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 216 flow [2022-12-06 04:09:21,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2022-12-06 04:09:21,043 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-06 04:09:21,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:21,043 INFO L89 Accepts]: Start accepts. Operand has 55 places, 38 transitions, 216 flow [2022-12-06 04:09:21,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:21,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:21,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 38 transitions, 216 flow [2022-12-06 04:09:21,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 38 transitions, 216 flow [2022-12-06 04:09:21,059 INFO L130 PetriNetUnfolder]: 71/191 cut-off events. [2022-12-06 04:09:21,060 INFO L131 PetriNetUnfolder]: For 269/288 co-relation queries the response was YES. [2022-12-06 04:09:21,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 191 events. 71/191 cut-off events. For 269/288 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 934 event pairs, 4 based on Foata normal form. 7/186 useless extension candidates. Maximal degree in co-relation 569. Up to 62 conditions per place. [2022-12-06 04:09:21,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 38 transitions, 216 flow [2022-12-06 04:09:21,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 04:09:21,733 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:21,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 691 [2022-12-06 04:09:21,735 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 212 flow [2022-12-06 04:09:21,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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 04:09:21,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:21,735 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 04:09:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:09:21,735 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1419098983, now seen corresponding path program 1 times [2022-12-06 04:09:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747827964] [2022-12-06 04:09:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:22,562 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 04:09:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:22,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747827964] [2022-12-06 04:09:22,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747827964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:22,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:22,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:22,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791303288] [2022-12-06 04:09:22,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:22,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:22,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:22,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:22,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:09:22,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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 04:09:22,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:22,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:09:22,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:22,847 INFO L130 PetriNetUnfolder]: 335/619 cut-off events. [2022-12-06 04:09:22,847 INFO L131 PetriNetUnfolder]: For 1855/1858 co-relation queries the response was YES. [2022-12-06 04:09:22,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 619 events. 335/619 cut-off events. For 1855/1858 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2980 event pairs, 44 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 2474. Up to 267 conditions per place. [2022-12-06 04:09:22,849 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 40 selfloop transitions, 4 changer transitions 24/69 dead transitions. [2022-12-06 04:09:22,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 562 flow [2022-12-06 04:09:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-06 04:09:22,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32575757575757575 [2022-12-06 04:09:22,851 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 212 flow. Second operand 6 states and 43 transitions. [2022-12-06 04:09:22,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 562 flow [2022-12-06 04:09:22,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 554 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:22,859 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 221 flow [2022-12-06 04:09:22,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2022-12-06 04:09:22,859 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 04:09:22,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:22,860 INFO L89 Accepts]: Start accepts. Operand has 56 places, 36 transitions, 221 flow [2022-12-06 04:09:22,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:22,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:22,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 36 transitions, 221 flow [2022-12-06 04:09:22,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 36 transitions, 221 flow [2022-12-06 04:09:22,879 INFO L130 PetriNetUnfolder]: 77/202 cut-off events. [2022-12-06 04:09:22,879 INFO L131 PetriNetUnfolder]: For 279/287 co-relation queries the response was YES. [2022-12-06 04:09:22,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 202 events. 77/202 cut-off events. For 279/287 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 990 event pairs, 4 based on Foata normal form. 4/200 useless extension candidates. Maximal degree in co-relation 631. Up to 70 conditions per place. [2022-12-06 04:09:22,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 36 transitions, 221 flow [2022-12-06 04:09:22,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 04:09:23,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:23,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 361 [2022-12-06 04:09:23,221 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 228 flow [2022-12-06 04:09:23,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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 04:09:23,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:23,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:23,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:23,221 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1236729878, now seen corresponding path program 1 times [2022-12-06 04:09:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873942046] [2022-12-06 04:09:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:23,375 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 04:09:23,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:23,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873942046] [2022-12-06 04:09:23,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873942046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:23,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:23,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866306935] [2022-12-06 04:09:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:23,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:23,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:09:23,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:09:23,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:23,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:09:23,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:23,489 INFO L130 PetriNetUnfolder]: 189/393 cut-off events. [2022-12-06 04:09:23,489 INFO L131 PetriNetUnfolder]: For 1489/1492 co-relation queries the response was YES. [2022-12-06 04:09:23,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 393 events. 189/393 cut-off events. For 1489/1492 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1971 event pairs, 25 based on Foata normal form. 1/391 useless extension candidates. Maximal degree in co-relation 1715. Up to 180 conditions per place. [2022-12-06 04:09:23,491 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 33 selfloop transitions, 1 changer transitions 28/63 dead transitions. [2022-12-06 04:09:23,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 531 flow [2022-12-06 04:09:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:09:23,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 04:09:23,492 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 228 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:09:23,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 531 flow [2022-12-06 04:09:23,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 512 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:23,497 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 186 flow [2022-12-06 04:09:23,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2022-12-06 04:09:23,498 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 04:09:23,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:23,498 INFO L89 Accepts]: Start accepts. Operand has 54 places, 31 transitions, 186 flow [2022-12-06 04:09:23,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:23,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:23,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 31 transitions, 186 flow [2022-12-06 04:09:23,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 31 transitions, 186 flow [2022-12-06 04:09:23,511 INFO L130 PetriNetUnfolder]: 42/113 cut-off events. [2022-12-06 04:09:23,511 INFO L131 PetriNetUnfolder]: For 223/232 co-relation queries the response was YES. [2022-12-06 04:09:23,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 113 events. 42/113 cut-off events. For 223/232 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 464 event pairs, 4 based on Foata normal form. 5/113 useless extension candidates. Maximal degree in co-relation 368. Up to 40 conditions per place. [2022-12-06 04:09:23,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 31 transitions, 186 flow [2022-12-06 04:09:23,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 04:09:23,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:23,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 296 [2022-12-06 04:09:23,794 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 184 flow [2022-12-06 04:09:23,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:09:23,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:23,795 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 04:09:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:09:23,795 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1545376248, now seen corresponding path program 1 times [2022-12-06 04:09:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205967436] [2022-12-06 04:09:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:23,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:09:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:23,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:09:23,915 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:09:23,916 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:09:23,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:09:23,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:09:23,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:09:23,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:09:23,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:09:23,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:09:23,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:09:23,920 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:23,924 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:09:23,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:09:24,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:09:24 BasicIcfg [2022-12-06 04:09:24,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:09:24,011 INFO L158 Benchmark]: Toolchain (without parser) took 19114.31ms. Allocated memory was 184.5MB in the beginning and 591.4MB in the end (delta: 406.8MB). Free memory was 158.5MB in the beginning and 532.0MB in the end (delta: -373.5MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2022-12-06 04:09:24,012 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 161.0MB in the beginning and 160.9MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:09:24,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.06ms. Allocated memory is still 184.5MB. Free memory was 158.5MB in the beginning and 130.1MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:09:24,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.20ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 127.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:24,012 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:24,012 INFO L158 Benchmark]: RCFGBuilder took 731.96ms. Allocated memory is still 184.5MB. Free memory was 125.4MB in the beginning and 87.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:09:24,013 INFO L158 Benchmark]: TraceAbstraction took 17737.09ms. Allocated memory was 184.5MB in the beginning and 591.4MB in the end (delta: 406.8MB). Free memory was 87.2MB in the beginning and 532.0MB in the end (delta: -444.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:09:24,014 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 184.5MB. Free memory was 161.0MB in the beginning and 160.9MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.06ms. Allocated memory is still 184.5MB. Free memory was 158.5MB in the beginning and 130.1MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.20ms. Allocated memory is still 184.5MB. Free memory was 130.1MB in the beginning and 127.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 731.96ms. Allocated memory is still 184.5MB. Free memory was 125.4MB in the beginning and 87.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17737.09ms. Allocated memory was 184.5MB in the beginning and 591.4MB in the end (delta: 406.8MB). Free memory was 87.2MB in the beginning and 532.0MB in the end (delta: -444.8MB). There was no memory consumed. 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, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 1917, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1656, independent: 1614, independent conditional: 0, independent unconditional: 1614, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1656, independent: 1594, independent conditional: 0, independent unconditional: 1594, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1976, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1656, unknown conditional: 0, unknown unconditional: 1656] , Statistics on independence cache: Total cache size (in pairs): 2463, Positive cache size: 2421, Positive conditional cache size: 0, Positive unconditional cache size: 2421, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 121, independent conditional: 121, 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: 145, independent: 121, independent conditional: 4, independent unconditional: 117, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 121, independent conditional: 4, independent unconditional: 117, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 121, independent conditional: 4, independent unconditional: 117, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 130, independent: 110, independent conditional: 4, independent unconditional: 106, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 130, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 117, dependent conditional: 24, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 130, unknown conditional: 7, unknown unconditional: 123] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 110, Positive conditional cache size: 4, Positive unconditional cache size: 106, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 115, independent conditional: 115, 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: 132, independent: 115, independent conditional: 17, independent unconditional: 98, dependent: 17, dependent conditional: 8, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 115, independent conditional: 0, independent unconditional: 115, 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: 132, independent: 115, independent conditional: 0, independent unconditional: 115, 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: 14, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 121, Positive conditional cache size: 4, Positive unconditional cache size: 117, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 113, independent conditional: 113, 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: 131, independent: 113, independent conditional: 19, independent unconditional: 94, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, independent: 113, independent conditional: 0, independent unconditional: 113, 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: 131, independent: 113, independent conditional: 0, independent unconditional: 113, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 131, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 122, Positive conditional cache size: 4, Positive unconditional cache size: 118, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 168, independent conditional: 168, 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: 202, independent: 168, independent conditional: 70, independent unconditional: 98, dependent: 34, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 168, independent conditional: 54, independent unconditional: 114, 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: 202, independent: 168, independent conditional: 54, independent unconditional: 114, 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: 6, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 163, independent conditional: 51, independent unconditional: 112, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 140, Positive conditional cache size: 8, Positive unconditional cache size: 132, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 282, independent: 244, independent conditional: 102, independent unconditional: 142, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, independent: 244, independent conditional: 78, independent unconditional: 166, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 244, independent conditional: 78, independent unconditional: 166, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 282, independent: 239, independent conditional: 75, independent unconditional: 164, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 145, Positive conditional cache size: 11, Positive unconditional cache size: 134, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 322, independent: 280, independent conditional: 280, 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: 322, independent: 280, independent conditional: 114, independent unconditional: 166, dependent: 42, dependent conditional: 12, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 322, independent: 280, independent conditional: 90, independent unconditional: 190, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 322, independent: 280, independent conditional: 90, independent unconditional: 190, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 9, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 322, independent: 265, independent conditional: 81, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 160, Positive conditional cache size: 20, Positive unconditional cache size: 140, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 180, independent conditional: 100, independent unconditional: 80, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 204, independent: 180, independent conditional: 48, independent unconditional: 132, 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: 204, independent: 180, independent conditional: 48, independent unconditional: 132, 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: 3, independent: 3, independent conditional: 3, 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: 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: 204, independent: 177, independent conditional: 45, independent unconditional: 132, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 163, Positive conditional cache size: 23, Positive unconditional cache size: 140, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 59 PlacesBefore, 58 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 459, independent: 431, independent conditional: 431, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 459, independent: 431, independent conditional: 263, independent unconditional: 168, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 431, independent conditional: 164, independent unconditional: 267, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 431, independent conditional: 164, independent unconditional: 267, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 7, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 483, independent: 418, independent conditional: 157, independent unconditional: 261, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 233, Positive conditional cache size: 30, Positive unconditional cache size: 203, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 135, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 64 PlacesBefore, 60 PlacesAfterwards, 47 TransitionsBefore, 43 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 350, independent: 330, independent conditional: 330, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 350, independent: 330, independent conditional: 224, independent unconditional: 106, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 358, independent: 330, independent conditional: 187, independent unconditional: 143, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 358, independent: 330, independent conditional: 187, independent unconditional: 143, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 23, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 358, independent: 305, independent conditional: 164, independent unconditional: 141, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 27, unknown conditional: 24, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 297, Positive conditional cache size: 53, Positive unconditional cache size: 244, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 54 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 99, independent conditional: 64, independent unconditional: 35, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 99, independent conditional: 58, independent unconditional: 41, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 99, independent conditional: 58, independent unconditional: 41, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 107, independent: 97, independent conditional: 56, independent unconditional: 41, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 321, Positive conditional cache size: 55, Positive unconditional cache size: 266, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 54 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 52, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 327, Positive conditional cache size: 57, Positive unconditional cache size: 270, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, 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.3s, 52 PlacesBefore, 51 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent conditional: 0, independent unconditional: 4, 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: 11, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 340, Positive conditional cache size: 60, Positive unconditional cache size: 280, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 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. - UnprovableResult [Line: 871]: 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: 873]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 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: 17.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 16 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=6, InterpolantAutomatonStates: 61, 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.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 04:09:24,051 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...