/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/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:11:42,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:11:42,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:11:42,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:11:42,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:11:42,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:11:42,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:11:42,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:11:42,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:11:42,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:11:42,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:11:42,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:11:42,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:11:42,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:11:42,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:11:42,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:11:42,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:11:42,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:11:42,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:11:42,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:11:42,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:11:42,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:11:42,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:11:42,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:11:42,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:11:42,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:11:42,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:11:42,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:11:42,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:11:42,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:11:42,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:11:42,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:11:42,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:11:42,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:11:42,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:11:42,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:11:42,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:11:42,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:11:42,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:11:42,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:11:42,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:11:42,545 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:11:42,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:11:42,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:11:42,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:11:42,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:11:42,566 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:11:42,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:11:42,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:11:42,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:11:42,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:11:42,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:11:42,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:11:42,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:11:42,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:11:42,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:11:42,569 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:11:42,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:11:42,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:11:42,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:11:42,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:11:42,831 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:11:42,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:11:43,755 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:11:43,999 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:11:44,000 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:11:44,017 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2177d82f/5ee70c3a8e6a4c13a9854ce97b31472d/FLAGff70f7848 [2022-12-06 04:11:44,031 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2177d82f/5ee70c3a8e6a4c13a9854ce97b31472d [2022-12-06 04:11:44,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:11:44,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:11:44,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:11:44,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:11:44,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:11:44,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d12f739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44, skipping insertion in model container [2022-12-06 04:11:44,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:11:44,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:11:44,291 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 04:11:44,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:11:44,542 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:11:44,552 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 04:11:44,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:44,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:44,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:11:44,648 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:11:44,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44 WrapperNode [2022-12-06 04:11:44,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:11:44,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:11:44,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:11:44,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:11:44,654 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:11:44" (1/1) ... [2022-12-06 04:11:44,685 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:11:44" (1/1) ... [2022-12-06 04:11:44,704 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-06 04:11:44,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:11:44,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:11:44,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:11:44,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:11:44,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,736 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:11:44,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:11:44,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:11:44,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:11:44,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (1/1) ... [2022-12-06 04:11:44,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:11:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:11:44,812 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:11:44,820 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:11:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:11:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:11:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:11:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:11:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:11:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:11:44,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:11:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:11:44,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:11:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:11:44,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:11:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:11:44,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:11:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:11:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:11:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:11:44,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:11:44,865 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:11:45,009 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:11:45,011 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:11:45,344 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:11:45,455 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:11:45,455 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:11:45,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:11:45 BoogieIcfgContainer [2022-12-06 04:11:45,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:11:45,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:11:45,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:11:45,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:11:45,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:11:44" (1/3) ... [2022-12-06 04:11:45,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148a139c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:11:45, skipping insertion in model container [2022-12-06 04:11:45,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:44" (2/3) ... [2022-12-06 04:11:45,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148a139c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:11:45, skipping insertion in model container [2022-12-06 04:11:45,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:11:45" (3/3) ... [2022-12-06 04:11:45,465 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:11:45,480 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:11:45,480 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:11:45,480 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:11:45,544 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:11:45,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:11:45,630 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:11:45,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:45,638 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 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:11:45,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:11:45,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 04:11:45,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:45,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:11:45,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 04:11:45,699 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:11:45,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:45,705 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 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:11:45,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:11:45,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-06 04:11:50,894 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 04:11:50,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:11:50,910 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;@1ebf8992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:11:50,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:11:50,913 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:11:50,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:50,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:50,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:50,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -375403712, now seen corresponding path program 1 times [2022-12-06 04:11:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:50,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968180265] [2022-12-06 04:11:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:51,203 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:11:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:51,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968180265] [2022-12-06 04:11:51,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968180265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:51,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:51,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:11:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197995600] [2022-12-06 04:11:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:51,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:51,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-06 04:11:51,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:11:51,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:51,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-06 04:11:51,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:51,766 INFO L130 PetriNetUnfolder]: 3519/5103 cut-off events. [2022-12-06 04:11:51,766 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 04:11:51,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 5103 events. 3519/5103 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27245 event pairs, 954 based on Foata normal form. 0/4619 useless extension candidates. Maximal degree in co-relation 10071. Up to 3826 conditions per place. [2022-12-06 04:11:51,787 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2022-12-06 04:11:51,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2022-12-06 04:11:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 04:11:51,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2022-12-06 04:11:51,795 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 61 transitions. [2022-12-06 04:11:51,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2022-12-06 04:11:51,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:11:51,799 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-06 04:11:51,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:11:51,802 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-06 04:11:51,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:51,803 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 66 flow [2022-12-06 04:11:51,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:51,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:51,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 66 flow [2022-12-06 04:11:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:11:51,810 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:11:51,810 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:11:51,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:11:51,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:11:51,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:51,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:11:51,854 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 04:11:51,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:11:51,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:51,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:51,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:11:51,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:51,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash 879830714, now seen corresponding path program 1 times [2022-12-06 04:11:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:51,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199369991] [2022-12-06 04:11:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:52,111 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:11:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199369991] [2022-12-06 04:11:52,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199369991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:52,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:52,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:11:52,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224033646] [2022-12-06 04:11:52,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:52,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:52,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:52,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:52,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:52,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:11:52,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:52,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:52,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:52,437 INFO L130 PetriNetUnfolder]: 2551/3709 cut-off events. [2022-12-06 04:11:52,437 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-06 04:11:52,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7623 conditions, 3709 events. 2551/3709 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18645 event pairs, 1015 based on Foata normal form. 96/3786 useless extension candidates. Maximal degree in co-relation 7613. Up to 2209 conditions per place. [2022-12-06 04:11:52,456 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 31 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-06 04:11:52,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 154 flow [2022-12-06 04:11:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:11:52,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2022-12-06 04:11:52,458 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:11:52,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 154 flow [2022-12-06 04:11:52,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:52,460 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 70 flow [2022-12-06 04:11:52,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, 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=70, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 04:11:52,460 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2022-12-06 04:11:52,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:52,460 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 70 flow [2022-12-06 04:11:52,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:52,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:52,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 70 flow [2022-12-06 04:11:52,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 70 flow [2022-12-06 04:11:52,466 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:11:52,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:52,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:11:52,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 70 flow [2022-12-06 04:11:52,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-06 04:11:52,477 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:52,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:11:52,479 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-06 04:11:52,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:11:52,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:52,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:52,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:11:52,482 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash -592355939, now seen corresponding path program 1 times [2022-12-06 04:11:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:52,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096030161] [2022-12-06 04:11:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:52,877 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:11:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:52,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096030161] [2022-12-06 04:11:52,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096030161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:52,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:52,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566721162] [2022-12-06 04:11:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:52,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:52,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:52,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:52,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:52,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:52,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:52,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:53,224 INFO L130 PetriNetUnfolder]: 2670/3873 cut-off events. [2022-12-06 04:11:53,225 INFO L131 PetriNetUnfolder]: For 180/195 co-relation queries the response was YES. [2022-12-06 04:11:53,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7931 conditions, 3873 events. 2670/3873 cut-off events. For 180/195 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19340 event pairs, 900 based on Foata normal form. 24/3863 useless extension candidates. Maximal degree in co-relation 7920. Up to 3460 conditions per place. [2022-12-06 04:11:53,241 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2022-12-06 04:11:53,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 204 flow [2022-12-06 04:11:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:11:53,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2022-12-06 04:11:53,242 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:11:53,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 204 flow [2022-12-06 04:11:53,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:53,244 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 105 flow [2022-12-06 04:11:53,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-06 04:11:53,244 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2022-12-06 04:11:53,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:53,244 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 105 flow [2022-12-06 04:11:53,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:53,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:53,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 105 flow [2022-12-06 04:11:53,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 105 flow [2022-12-06 04:11:53,251 INFO L130 PetriNetUnfolder]: 6/51 cut-off events. [2022-12-06 04:11:53,251 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 04:11:53,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 51 events. 6/51 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 86. Up to 12 conditions per place. [2022-12-06 04:11:53,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 105 flow [2022-12-06 04:11:53,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 04:11:53,266 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:53,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 04:11:53,266 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 105 flow [2022-12-06 04:11:53,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:53,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:53,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:53,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:11:53,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1185845516, now seen corresponding path program 1 times [2022-12-06 04:11:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:53,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137846258] [2022-12-06 04:11:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:53,658 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:11:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:53,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137846258] [2022-12-06 04:11:53,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137846258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:53,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:53,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604125102] [2022-12-06 04:11:53,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:53,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:11:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:11:53,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:11:53,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:53,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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:11:53,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:53,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:53,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:54,177 INFO L130 PetriNetUnfolder]: 2702/3917 cut-off events. [2022-12-06 04:11:54,178 INFO L131 PetriNetUnfolder]: For 1455/1662 co-relation queries the response was YES. [2022-12-06 04:11:54,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9167 conditions, 3917 events. 2702/3917 cut-off events. For 1455/1662 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19542 event pairs, 840 based on Foata normal form. 54/3940 useless extension candidates. Maximal degree in co-relation 9154. Up to 3460 conditions per place. [2022-12-06 04:11:54,202 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 41 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 04:11:54,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 255 flow [2022-12-06 04:11:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 04:11:54,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-06 04:11:54,204 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 105 flow. Second operand 4 states and 64 transitions. [2022-12-06 04:11:54,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 255 flow [2022-12-06 04:11:54,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:11:54,207 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 148 flow [2022-12-06 04:11:54,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-06 04:11:54,208 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-06 04:11:54,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:54,208 INFO L89 Accepts]: Start accepts. Operand has 46 places, 36 transitions, 148 flow [2022-12-06 04:11:54,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:54,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:54,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 148 flow [2022-12-06 04:11:54,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 148 flow [2022-12-06 04:11:54,225 INFO L130 PetriNetUnfolder]: 40/109 cut-off events. [2022-12-06 04:11:54,225 INFO L131 PetriNetUnfolder]: For 80/101 co-relation queries the response was YES. [2022-12-06 04:11:54,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 109 events. 40/109 cut-off events. For 80/101 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 384 event pairs, 14 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 261. Up to 66 conditions per place. [2022-12-06 04:11:54,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 148 flow [2022-12-06 04:11:54,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-06 04:11:54,275 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:54,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 04:11:54,276 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 148 flow [2022-12-06 04:11:54,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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:11:54,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:54,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:54,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:11:54,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1183194086, now seen corresponding path program 2 times [2022-12-06 04:11:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:54,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788167891] [2022-12-06 04:11:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:54,618 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:11:54,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:54,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788167891] [2022-12-06 04:11:54,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788167891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388469583] [2022-12-06 04:11:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:54,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:11:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:54,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:11:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:11:54,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:54,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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:11:54,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:54,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:54,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:55,050 INFO L130 PetriNetUnfolder]: 2680/3871 cut-off events. [2022-12-06 04:11:55,050 INFO L131 PetriNetUnfolder]: For 2481/2928 co-relation queries the response was YES. [2022-12-06 04:11:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10296 conditions, 3871 events. 2680/3871 cut-off events. For 2481/2928 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19220 event pairs, 994 based on Foata normal form. 96/3951 useless extension candidates. Maximal degree in co-relation 10280. Up to 3432 conditions per place. [2022-12-06 04:11:55,065 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 47 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2022-12-06 04:11:55,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 380 flow [2022-12-06 04:11:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:11:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:11:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 04:11:55,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.562962962962963 [2022-12-06 04:11:55,067 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 148 flow. Second operand 5 states and 76 transitions. [2022-12-06 04:11:55,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 380 flow [2022-12-06 04:11:55,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 353 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:55,071 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 247 flow [2022-12-06 04:11:55,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-06 04:11:55,072 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2022-12-06 04:11:55,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:55,072 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 247 flow [2022-12-06 04:11:55,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:55,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:55,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 247 flow [2022-12-06 04:11:55,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 247 flow [2022-12-06 04:11:55,084 INFO L130 PetriNetUnfolder]: 38/112 cut-off events. [2022-12-06 04:11:55,084 INFO L131 PetriNetUnfolder]: For 143/197 co-relation queries the response was YES. [2022-12-06 04:11:55,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 112 events. 38/112 cut-off events. For 143/197 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 404 event pairs, 8 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 321. Up to 59 conditions per place. [2022-12-06 04:11:55,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 247 flow [2022-12-06 04:11:55,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-06 04:11:55,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:55,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:11:55,113 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 247 flow [2022-12-06 04:11:55,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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:11:55,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:55,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:55,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:11:55,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 175773621, now seen corresponding path program 1 times [2022-12-06 04:11:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:55,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981676062] [2022-12-06 04:11:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:55,369 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:11:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981676062] [2022-12-06 04:11:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981676062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:55,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:55,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53253411] [2022-12-06 04:11:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:55,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:11:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:11:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:11:55,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:55,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:11:55,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:55,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:55,841 INFO L130 PetriNetUnfolder]: 2749/3973 cut-off events. [2022-12-06 04:11:55,841 INFO L131 PetriNetUnfolder]: For 4869/5691 co-relation queries the response was YES. [2022-12-06 04:11:55,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11667 conditions, 3973 events. 2749/3973 cut-off events. For 4869/5691 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19522 event pairs, 470 based on Foata normal form. 153/4122 useless extension candidates. Maximal degree in co-relation 11648. Up to 2993 conditions per place. [2022-12-06 04:11:55,878 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 64 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2022-12-06 04:11:55,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 537 flow [2022-12-06 04:11:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:11:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:11:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 04:11:55,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-06 04:11:55,880 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 247 flow. Second operand 5 states and 87 transitions. [2022-12-06 04:11:55,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 537 flow [2022-12-06 04:11:55,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 517 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:55,894 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 327 flow [2022-12-06 04:11:55,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-06 04:11:55,897 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-06 04:11:55,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:55,897 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 327 flow [2022-12-06 04:11:55,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:55,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:55,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 327 flow [2022-12-06 04:11:55,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 327 flow [2022-12-06 04:11:55,921 INFO L130 PetriNetUnfolder]: 66/165 cut-off events. [2022-12-06 04:11:55,922 INFO L131 PetriNetUnfolder]: For 459/560 co-relation queries the response was YES. [2022-12-06 04:11:55,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 165 events. 66/165 cut-off events. For 459/560 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 700 event pairs, 15 based on Foata normal form. 3/164 useless extension candidates. Maximal degree in co-relation 586. Up to 79 conditions per place. [2022-12-06 04:11:55,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 327 flow [2022-12-06 04:11:55,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-06 04:11:55,931 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:55,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:11:55,932 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 327 flow [2022-12-06 04:11:55,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:11:55,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:55,932 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:11:55,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:11:55,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1150914438, now seen corresponding path program 1 times [2022-12-06 04:11:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:55,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726699003] [2022-12-06 04:11:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:56,459 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:11:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726699003] [2022-12-06 04:11:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726699003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:56,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:56,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:11:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134409382] [2022-12-06 04:11:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:56,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:11:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:11:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:11:56,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:56,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:11:56,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:56,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:56,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:56,968 INFO L130 PetriNetUnfolder]: 2789/4031 cut-off events. [2022-12-06 04:11:56,969 INFO L131 PetriNetUnfolder]: For 8934/10224 co-relation queries the response was YES. [2022-12-06 04:11:56,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13394 conditions, 4031 events. 2789/4031 cut-off events. For 8934/10224 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19853 event pairs, 643 based on Foata normal form. 195/4222 useless extension candidates. Maximal degree in co-relation 13372. Up to 3017 conditions per place. [2022-12-06 04:11:56,989 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 59 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2022-12-06 04:11:56,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 571 flow [2022-12-06 04:11:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:11:56,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 04:11:56,991 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 327 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:11:56,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 571 flow [2022-12-06 04:11:57,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 549 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:57,028 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 391 flow [2022-12-06 04:11:57,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-06 04:11:57,028 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2022-12-06 04:11:57,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:57,029 INFO L89 Accepts]: Start accepts. Operand has 60 places, 56 transitions, 391 flow [2022-12-06 04:11:57,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:57,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:57,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions, 391 flow [2022-12-06 04:11:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions, 391 flow [2022-12-06 04:11:57,056 INFO L130 PetriNetUnfolder]: 72/167 cut-off events. [2022-12-06 04:11:57,056 INFO L131 PetriNetUnfolder]: For 763/912 co-relation queries the response was YES. [2022-12-06 04:11:57,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 167 events. 72/167 cut-off events. For 763/912 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 691 event pairs, 20 based on Foata normal form. 3/167 useless extension candidates. Maximal degree in co-relation 681. Up to 77 conditions per place. [2022-12-06 04:11:57,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 56 transitions, 391 flow [2022-12-06 04:11:57,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 04:11:57,063 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:57,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 04:11:57,066 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 391 flow [2022-12-06 04:11:57,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:11:57,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:57,066 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:11:57,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:11:57,066 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1154072284, now seen corresponding path program 1 times [2022-12-06 04:11:57,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:57,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478044844] [2022-12-06 04:11:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:57,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:57,428 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:11:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478044844] [2022-12-06 04:11:57,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478044844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:57,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:57,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:11:57,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598632697] [2022-12-06 04:11:57,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:57,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:11:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:11:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:11:57,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:11:57,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:11:57,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:57,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:11:57,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:58,019 INFO L130 PetriNetUnfolder]: 2945/4259 cut-off events. [2022-12-06 04:11:58,019 INFO L131 PetriNetUnfolder]: For 12948/14748 co-relation queries the response was YES. [2022-12-06 04:11:58,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15203 conditions, 4259 events. 2945/4259 cut-off events. For 12948/14748 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21358 event pairs, 505 based on Foata normal form. 285/4540 useless extension candidates. Maximal degree in co-relation 15178. Up to 3095 conditions per place. [2022-12-06 04:11:58,057 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 79 selfloop transitions, 29 changer transitions 0/112 dead transitions. [2022-12-06 04:11:58,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 829 flow [2022-12-06 04:11:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:11:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:11:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 04:11:58,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2022-12-06 04:11:58,059 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 391 flow. Second operand 8 states and 121 transitions. [2022-12-06 04:11:58,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 829 flow [2022-12-06 04:11:58,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 799 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:58,083 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 556 flow [2022-12-06 04:11:58,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=556, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2022-12-06 04:11:58,084 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2022-12-06 04:11:58,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:58,084 INFO L89 Accepts]: Start accepts. Operand has 68 places, 68 transitions, 556 flow [2022-12-06 04:11:58,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:58,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:58,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 68 transitions, 556 flow [2022-12-06 04:11:58,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 68 transitions, 556 flow [2022-12-06 04:11:58,114 INFO L130 PetriNetUnfolder]: 86/193 cut-off events. [2022-12-06 04:11:58,114 INFO L131 PetriNetUnfolder]: For 1117/1286 co-relation queries the response was YES. [2022-12-06 04:11:58,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 193 events. 86/193 cut-off events. For 1117/1286 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 784 event pairs, 12 based on Foata normal form. 3/193 useless extension candidates. Maximal degree in co-relation 903. Up to 84 conditions per place. [2022-12-06 04:11:58,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 68 transitions, 556 flow [2022-12-06 04:11:58,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-06 04:11:58,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse4 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257) (= v_~y~0_190 (ite .cse4 v_~y$w_buff0~0_149 (ite .cse3 v_~y$w_buff1~0_152 v_~y~0_191)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_190, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:58,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse4 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257) (= v_~y~0_190 (ite .cse4 v_~y$w_buff0~0_149 (ite .cse3 v_~y$w_buff1~0_152 v_~y~0_191)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_190, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:58,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse4 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257) (= v_~y~0_190 (ite .cse4 v_~y$w_buff0~0_149 (ite .cse3 v_~y$w_buff1~0_152 v_~y~0_191)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_190, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:58,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:11:58,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse4 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257) (= v_~y~0_190 (ite .cse4 v_~y$w_buff0~0_149 (ite .cse3 v_~y$w_buff1~0_152 v_~y~0_191)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_190, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:11:59,040 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:11:59,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 957 [2022-12-06 04:11:59,041 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 574 flow [2022-12-06 04:11:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:11:59,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:59,042 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:11:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:11:59,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -751331246, now seen corresponding path program 2 times [2022-12-06 04:11:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:59,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474673221] [2022-12-06 04:11:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:59,351 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:11:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:59,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474673221] [2022-12-06 04:11:59,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474673221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:59,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:59,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:11:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545626387] [2022-12-06 04:11:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:11:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:11:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:11:59,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:11:59,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:11:59,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:59,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:11:59,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:59,971 INFO L130 PetriNetUnfolder]: 3258/4761 cut-off events. [2022-12-06 04:11:59,971 INFO L131 PetriNetUnfolder]: For 22911/25488 co-relation queries the response was YES. [2022-12-06 04:11:59,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18502 conditions, 4761 events. 3258/4761 cut-off events. For 22911/25488 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25456 event pairs, 348 based on Foata normal form. 282/5039 useless extension candidates. Maximal degree in co-relation 18474. Up to 2806 conditions per place. [2022-12-06 04:12:00,002 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 71 selfloop transitions, 35 changer transitions 0/110 dead transitions. [2022-12-06 04:12:00,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 966 flow [2022-12-06 04:12:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:12:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:12:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 04:12:00,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-06 04:12:00,003 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 574 flow. Second operand 6 states and 106 transitions. [2022-12-06 04:12:00,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 966 flow [2022-12-06 04:12:00,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 878 flow, removed 41 selfloop flow, removed 2 redundant places. [2022-12-06 04:12:00,041 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 628 flow [2022-12-06 04:12:00,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=628, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2022-12-06 04:12:00,042 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2022-12-06 04:12:00,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:00,042 INFO L89 Accepts]: Start accepts. Operand has 70 places, 69 transitions, 628 flow [2022-12-06 04:12:00,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:00,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:00,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 628 flow [2022-12-06 04:12:00,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 69 transitions, 628 flow [2022-12-06 04:12:00,076 INFO L130 PetriNetUnfolder]: 92/212 cut-off events. [2022-12-06 04:12:00,076 INFO L131 PetriNetUnfolder]: For 1494/1722 co-relation queries the response was YES. [2022-12-06 04:12:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 212 events. 92/212 cut-off events. For 1494/1722 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 959 event pairs, 4 based on Foata normal form. 4/213 useless extension candidates. Maximal degree in co-relation 1024. Up to 86 conditions per place. [2022-12-06 04:12:00,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 69 transitions, 628 flow [2022-12-06 04:12:00,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 906 [2022-12-06 04:12:00,082 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:12:00,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:12:00,083 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 628 flow [2022-12-06 04:12:00,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:12:00,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:00,083 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:12:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:12:00,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1164740252, now seen corresponding path program 1 times [2022-12-06 04:12:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:00,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17707729] [2022-12-06 04:12:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:00,493 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:12:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17707729] [2022-12-06 04:12:00,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17707729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:00,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:00,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:12:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350034919] [2022-12-06 04:12:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:00,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:12:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:12:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:12:00,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:12:00,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:12:00,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:00,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:12:00,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:01,063 INFO L130 PetriNetUnfolder]: 3470/5069 cut-off events. [2022-12-06 04:12:01,063 INFO L131 PetriNetUnfolder]: For 27897/29943 co-relation queries the response was YES. [2022-12-06 04:12:01,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20638 conditions, 5069 events. 3470/5069 cut-off events. For 27897/29943 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 27134 event pairs, 454 based on Foata normal form. 345/5404 useless extension candidates. Maximal degree in co-relation 20608. Up to 3632 conditions per place. [2022-12-06 04:12:01,089 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 81 selfloop transitions, 30 changer transitions 0/115 dead transitions. [2022-12-06 04:12:01,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 1044 flow [2022-12-06 04:12:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:12:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:12:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-12-06 04:12:01,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 04:12:01,090 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 628 flow. Second operand 7 states and 112 transitions. [2022-12-06 04:12:01,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 1044 flow [2022-12-06 04:12:01,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 115 transitions, 991 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 04:12:01,121 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 713 flow [2022-12-06 04:12:01,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=713, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2022-12-06 04:12:01,121 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2022-12-06 04:12:01,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:01,122 INFO L89 Accepts]: Start accepts. Operand has 74 places, 74 transitions, 713 flow [2022-12-06 04:12:01,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:01,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:01,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 74 transitions, 713 flow [2022-12-06 04:12:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 74 transitions, 713 flow [2022-12-06 04:12:01,144 INFO L130 PetriNetUnfolder]: 96/224 cut-off events. [2022-12-06 04:12:01,144 INFO L131 PetriNetUnfolder]: For 1946/2371 co-relation queries the response was YES. [2022-12-06 04:12:01,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 224 events. 96/224 cut-off events. For 1946/2371 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1016 event pairs, 3 based on Foata normal form. 5/226 useless extension candidates. Maximal degree in co-relation 1106. Up to 92 conditions per place. [2022-12-06 04:12:01,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 74 transitions, 713 flow [2022-12-06 04:12:01,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-06 04:12:01,150 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:12:01,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 04:12:01,151 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 713 flow [2022-12-06 04:12:01,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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:12:01,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:01,151 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:12:01,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:12:01,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:01,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1107420115, now seen corresponding path program 1 times [2022-12-06 04:12:01,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:01,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095361053] [2022-12-06 04:12:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:01,802 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:12:01,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:01,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095361053] [2022-12-06 04:12:01,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095361053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:01,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:01,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:12:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537456475] [2022-12-06 04:12:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:01,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:12:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:01,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:12:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:12:01,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 04:12:01,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 713 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:12:01,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:01,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 04:12:01,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:03,440 INFO L130 PetriNetUnfolder]: 12953/17658 cut-off events. [2022-12-06 04:12:03,441 INFO L131 PetriNetUnfolder]: For 86564/86564 co-relation queries the response was YES. [2022-12-06 04:12:03,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67407 conditions, 17658 events. 12953/17658 cut-off events. For 86564/86564 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 91967 event pairs, 2287 based on Foata normal form. 216/17874 useless extension candidates. Maximal degree in co-relation 67376. Up to 10051 conditions per place. [2022-12-06 04:12:03,510 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 106 selfloop transitions, 10 changer transitions 14/130 dead transitions. [2022-12-06 04:12:03,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 130 transitions, 1374 flow [2022-12-06 04:12:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:12:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:12:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 04:12:03,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 04:12:03,512 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 713 flow. Second operand 4 states and 70 transitions. [2022-12-06 04:12:03,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 130 transitions, 1374 flow [2022-12-06 04:12:03,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 1284 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 04:12:03,682 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 695 flow [2022-12-06 04:12:03,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2022-12-06 04:12:03,683 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2022-12-06 04:12:03,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:03,683 INFO L89 Accepts]: Start accepts. Operand has 75 places, 76 transitions, 695 flow [2022-12-06 04:12:03,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:03,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:03,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 76 transitions, 695 flow [2022-12-06 04:12:03,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 76 transitions, 695 flow [2022-12-06 04:12:03,813 INFO L130 PetriNetUnfolder]: 281/684 cut-off events. [2022-12-06 04:12:03,813 INFO L131 PetriNetUnfolder]: For 5060/5645 co-relation queries the response was YES. [2022-12-06 04:12:03,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 684 events. 281/684 cut-off events. For 5060/5645 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4563 event pairs, 18 based on Foata normal form. 25/676 useless extension candidates. Maximal degree in co-relation 3148. Up to 296 conditions per place. [2022-12-06 04:12:03,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 76 transitions, 695 flow [2022-12-06 04:12:03,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 968 [2022-12-06 04:12:03,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:12:03,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 04:12:03,896 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 695 flow [2022-12-06 04:12:03,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:12:03,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:03,896 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:12:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:12:03,896 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1048653573, now seen corresponding path program 2 times [2022-12-06 04:12:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331644622] [2022-12-06 04:12:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:04,105 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:12:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:04,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331644622] [2022-12-06 04:12:04,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331644622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:04,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:04,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:12:04,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133158841] [2022-12-06 04:12:04,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:04,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:12:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:04,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:12:04,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:12:04,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-06 04:12:04,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 695 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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:12:04,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:04,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-06 04:12:04,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:05,222 INFO L130 PetriNetUnfolder]: 4914/7552 cut-off events. [2022-12-06 04:12:05,222 INFO L131 PetriNetUnfolder]: For 51763/52331 co-relation queries the response was YES. [2022-12-06 04:12:05,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31629 conditions, 7552 events. 4914/7552 cut-off events. For 51763/52331 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 47428 event pairs, 743 based on Foata normal form. 841/8306 useless extension candidates. Maximal degree in co-relation 31595. Up to 4810 conditions per place. [2022-12-06 04:12:05,285 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 10 changer transitions 6/172 dead transitions. [2022-12-06 04:12:05,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 172 transitions, 1836 flow [2022-12-06 04:12:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:12:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:12:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 04:12:05,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2022-12-06 04:12:05,288 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 695 flow. Second operand 5 states and 101 transitions. [2022-12-06 04:12:05,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 172 transitions, 1836 flow [2022-12-06 04:12:05,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 172 transitions, 1817 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:12:05,328 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 765 flow [2022-12-06 04:12:05,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2022-12-06 04:12:05,329 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2022-12-06 04:12:05,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:05,329 INFO L89 Accepts]: Start accepts. Operand has 81 places, 83 transitions, 765 flow [2022-12-06 04:12:05,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:05,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:05,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 83 transitions, 765 flow [2022-12-06 04:12:05,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 765 flow [2022-12-06 04:12:05,546 INFO L130 PetriNetUnfolder]: 948/1810 cut-off events. [2022-12-06 04:12:05,546 INFO L131 PetriNetUnfolder]: For 10327/12092 co-relation queries the response was YES. [2022-12-06 04:12:05,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8362 conditions, 1810 events. 948/1810 cut-off events. For 10327/12092 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 12841 event pairs, 271 based on Foata normal form. 94/1659 useless extension candidates. Maximal degree in co-relation 8327. Up to 968 conditions per place. [2022-12-06 04:12:05,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 83 transitions, 765 flow [2022-12-06 04:12:05,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 1142 [2022-12-06 04:12:05,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [434] L776-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P1Thread1of1ForFork1_#res.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-06 04:12:05,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [462] L829-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P3Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_9|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:12:05,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [484] L806-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_137 (+ v_~__unbuffered_cnt~0_138 1)) (= |v_P2Thread1of1ForFork2_#res#1.base_17| 0) (= |v_P2Thread1of1ForFork2_#res#1.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138} OutVars{P2Thread1of1ForFork2_#res#1.offset=|v_P2Thread1of1ForFork2_#res#1.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P2Thread1of1ForFork2_#res#1.base=|v_P2Thread1of1ForFork2_#res#1.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res#1.base] [2022-12-06 04:12:05,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [492] L754-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_163 (+ v_~__unbuffered_cnt~0_164 1)) (= |v_P0Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_164} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-06 04:12:05,736 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:12:05,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-06 04:12:05,736 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 775 flow [2022-12-06 04:12:05,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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:12:05,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:05,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:12:05,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:12:05,737 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1639580681, now seen corresponding path program 1 times [2022-12-06 04:12:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:05,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640257030] [2022-12-06 04:12:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:05,835 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:12:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:05,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640257030] [2022-12-06 04:12:05,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640257030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:05,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:05,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:12:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433090384] [2022-12-06 04:12:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:05,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:12:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:12:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:12:05,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2022-12-06 04:12:05,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 775 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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:12:05,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:05,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2022-12-06 04:12:05,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:06,583 INFO L130 PetriNetUnfolder]: 3524/5674 cut-off events. [2022-12-06 04:12:06,584 INFO L131 PetriNetUnfolder]: For 43855/44344 co-relation queries the response was YES. [2022-12-06 04:12:06,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27224 conditions, 5674 events. 3524/5674 cut-off events. For 43855/44344 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 36167 event pairs, 331 based on Foata normal form. 565/6156 useless extension candidates. Maximal degree in co-relation 27186. Up to 2254 conditions per place. [2022-12-06 04:12:06,622 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 129 selfloop transitions, 18 changer transitions 12/167 dead transitions. [2022-12-06 04:12:06,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 1770 flow [2022-12-06 04:12:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:12:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:12:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-06 04:12:06,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 04:12:06,624 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 775 flow. Second operand 6 states and 119 transitions. [2022-12-06 04:12:06,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 1770 flow [2022-12-06 04:12:06,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 167 transitions, 1673 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-12-06 04:12:06,656 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 669 flow [2022-12-06 04:12:06,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=669, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2022-12-06 04:12:06,657 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2022-12-06 04:12:06,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:06,657 INFO L89 Accepts]: Start accepts. Operand has 81 places, 73 transitions, 669 flow [2022-12-06 04:12:06,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:06,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:06,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 73 transitions, 669 flow [2022-12-06 04:12:06,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 73 transitions, 669 flow [2022-12-06 04:12:06,789 INFO L130 PetriNetUnfolder]: 586/1297 cut-off events. [2022-12-06 04:12:06,789 INFO L131 PetriNetUnfolder]: For 9029/13742 co-relation queries the response was YES. [2022-12-06 04:12:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 1297 events. 586/1297 cut-off events. For 9029/13742 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 9399 event pairs, 73 based on Foata normal form. 67/1211 useless extension candidates. Maximal degree in co-relation 6750. Up to 827 conditions per place. [2022-12-06 04:12:06,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 73 transitions, 669 flow [2022-12-06 04:12:06,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 1164 [2022-12-06 04:12:06,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:12:06,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:12:06,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:12:07,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L766-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_288 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_501 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_293 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_460 256) 0)) .cse1)) (.cse4 (and (not (= 0 (mod v_~y$w_buff0_used~0_502 256))) .cse5))) (and (= v_~y$r_buff1_thd0~0_287 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd0~0_292 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_459 256) 0)) .cse1)) 0 v_~y$r_buff1_thd0~0_288)) (= v_~y$r_buff0_thd0~0_292 (ite .cse2 0 v_~y$r_buff0_thd0~0_293)) (= v_~y$w_buff1_used~0_459 (ite (or .cse3 .cse2) 0 v_~y$w_buff1_used~0_460)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_64| 0)) (= v_~y~0_421 (ite .cse4 v_~y$w_buff0~0_315 (ite .cse3 v_~y$w_buff1~0_301 1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_502) v_~y$w_buff0_used~0_501)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_502, ~y$w_buff1~0=v_~y$w_buff1~0_301, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_293, ~y$w_buff0~0=v_~y$w_buff0~0_315, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_64|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_288, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_460} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_501, ~y$w_buff1~0=v_~y$w_buff1~0_301, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, ~y$w_buff0~0=v_~y$w_buff0~0_315, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_64|, ~y~0=v_~y~0_421, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_287, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_459} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:12:07,362 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:12:07,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 705 [2022-12-06 04:12:07,362 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 693 flow [2022-12-06 04:12:07,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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:12:07,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:07,363 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:12:07,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:12:07,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash 41081777, now seen corresponding path program 1 times [2022-12-06 04:12:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:07,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028882872] [2022-12-06 04:12:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:07,464 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:12:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:07,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028882872] [2022-12-06 04:12:07,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028882872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:07,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:07,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:12:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168260070] [2022-12-06 04:12:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:07,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:12:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:12:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:12:07,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 04:12:07,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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:12:07,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:07,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 04:12:07,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:08,086 INFO L130 PetriNetUnfolder]: 3194/5183 cut-off events. [2022-12-06 04:12:08,086 INFO L131 PetriNetUnfolder]: For 34775/34906 co-relation queries the response was YES. [2022-12-06 04:12:08,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26148 conditions, 5183 events. 3194/5183 cut-off events. For 34775/34906 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 33101 event pairs, 260 based on Foata normal form. 178/5269 useless extension candidates. Maximal degree in co-relation 26110. Up to 2136 conditions per place. [2022-12-06 04:12:08,119 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 131 selfloop transitions, 27 changer transitions 24/189 dead transitions. [2022-12-06 04:12:08,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 2061 flow [2022-12-06 04:12:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:12:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:12:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-12-06 04:12:08,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2022-12-06 04:12:08,120 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 693 flow. Second operand 8 states and 160 transitions. [2022-12-06 04:12:08,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 2061 flow [2022-12-06 04:12:08,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 189 transitions, 1822 flow, removed 67 selfloop flow, removed 6 redundant places. [2022-12-06 04:12:08,366 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 698 flow [2022-12-06 04:12:08,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=698, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2022-12-06 04:12:08,367 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2022-12-06 04:12:08,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:08,367 INFO L89 Accepts]: Start accepts. Operand has 83 places, 77 transitions, 698 flow [2022-12-06 04:12:08,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:08,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:08,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 77 transitions, 698 flow [2022-12-06 04:12:08,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 77 transitions, 698 flow [2022-12-06 04:12:08,449 INFO L130 PetriNetUnfolder]: 398/993 cut-off events. [2022-12-06 04:12:08,449 INFO L131 PetriNetUnfolder]: For 7901/10024 co-relation queries the response was YES. [2022-12-06 04:12:08,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 993 events. 398/993 cut-off events. For 7901/10024 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 7304 event pairs, 7 based on Foata normal form. 42/911 useless extension candidates. Maximal degree in co-relation 4951. Up to 451 conditions per place. [2022-12-06 04:12:08,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 77 transitions, 698 flow [2022-12-06 04:12:08,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 04:12:08,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:12:08,887 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:12:08,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-06 04:12:08,888 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 676 flow [2022-12-06 04:12:08,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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:12:08,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:08,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:12:08,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:12:08,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1605934002, now seen corresponding path program 1 times [2022-12-06 04:12:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:08,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608509260] [2022-12-06 04:12:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:09,539 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:12:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:09,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608509260] [2022-12-06 04:12:09,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608509260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:09,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:09,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:12:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699698404] [2022-12-06 04:12:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:12:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:12:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:12:09,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 04:12:09,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 676 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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:12:09,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:09,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 04:12:09,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:10,634 INFO L130 PetriNetUnfolder]: 7762/11419 cut-off events. [2022-12-06 04:12:10,634 INFO L131 PetriNetUnfolder]: For 54803/54803 co-relation queries the response was YES. [2022-12-06 04:12:10,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52506 conditions, 11419 events. 7762/11419 cut-off events. For 54803/54803 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 65928 event pairs, 1384 based on Foata normal form. 11/11430 useless extension candidates. Maximal degree in co-relation 52468. Up to 5905 conditions per place. [2022-12-06 04:12:10,686 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 100 selfloop transitions, 23 changer transitions 122/245 dead transitions. [2022-12-06 04:12:10,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 245 transitions, 2619 flow [2022-12-06 04:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:12:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:12:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-06 04:12:10,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2022-12-06 04:12:10,688 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 676 flow. Second operand 6 states and 129 transitions. [2022-12-06 04:12:10,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 245 transitions, 2619 flow [2022-12-06 04:12:11,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 245 transitions, 2148 flow, removed 157 selfloop flow, removed 8 redundant places. [2022-12-06 04:12:11,060 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 681 flow [2022-12-06 04:12:11,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2022-12-06 04:12:11,061 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2022-12-06 04:12:11,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:11,061 INFO L89 Accepts]: Start accepts. Operand has 82 places, 77 transitions, 681 flow [2022-12-06 04:12:11,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:11,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:11,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 681 flow [2022-12-06 04:12:11,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 681 flow [2022-12-06 04:12:11,139 INFO L130 PetriNetUnfolder]: 519/1160 cut-off events. [2022-12-06 04:12:11,140 INFO L131 PetriNetUnfolder]: For 4128/4291 co-relation queries the response was YES. [2022-12-06 04:12:11,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4981 conditions, 1160 events. 519/1160 cut-off events. For 4128/4291 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7967 event pairs, 66 based on Foata normal form. 14/1097 useless extension candidates. Maximal degree in co-relation 4947. Up to 441 conditions per place. [2022-12-06 04:12:11,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 77 transitions, 681 flow [2022-12-06 04:12:11,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-06 04:12:11,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:12:11,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:12:11,152 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 681 flow [2022-12-06 04:12:11,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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:12:11,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:12:11,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:12:11,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:12:11,153 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:12:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:12:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1805176300, now seen corresponding path program 2 times [2022-12-06 04:12:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:12:11,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035648188] [2022-12-06 04:12:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:12:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:12:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:12:11,266 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:12:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:12:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035648188] [2022-12-06 04:12:11,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035648188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:12:11,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:12:11,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:12:11,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499325485] [2022-12-06 04:12:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:12:11,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:12:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:12:11,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:12:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:12:11,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-06 04:12:11,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 681 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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:12:11,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:12:11,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-06 04:12:11,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:12:11,807 INFO L130 PetriNetUnfolder]: 2641/4285 cut-off events. [2022-12-06 04:12:11,807 INFO L131 PetriNetUnfolder]: For 22279/22519 co-relation queries the response was YES. [2022-12-06 04:12:11,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21150 conditions, 4285 events. 2641/4285 cut-off events. For 22279/22519 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26398 event pairs, 339 based on Foata normal form. 152/4262 useless extension candidates. Maximal degree in co-relation 21113. Up to 1739 conditions per place. [2022-12-06 04:12:11,824 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 108 selfloop transitions, 18 changer transitions 32/167 dead transitions. [2022-12-06 04:12:11,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 1768 flow [2022-12-06 04:12:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:12:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:12:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-06 04:12:11,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2022-12-06 04:12:11,826 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 681 flow. Second operand 8 states and 131 transitions. [2022-12-06 04:12:11,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 1768 flow [2022-12-06 04:12:11,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 167 transitions, 1691 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 04:12:11,895 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 609 flow [2022-12-06 04:12:11,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=609, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2022-12-06 04:12:11,895 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2022-12-06 04:12:11,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:11,895 INFO L89 Accepts]: Start accepts. Operand has 83 places, 71 transitions, 609 flow [2022-12-06 04:12:11,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:11,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:11,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 71 transitions, 609 flow [2022-12-06 04:12:11,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 71 transitions, 609 flow [2022-12-06 04:12:11,946 INFO L130 PetriNetUnfolder]: 332/767 cut-off events. [2022-12-06 04:12:11,946 INFO L131 PetriNetUnfolder]: For 2458/2599 co-relation queries the response was YES. [2022-12-06 04:12:11,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 767 events. 332/767 cut-off events. For 2458/2599 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4848 event pairs, 45 based on Foata normal form. 10/737 useless extension candidates. Maximal degree in co-relation 3375. Up to 323 conditions per place. [2022-12-06 04:12:11,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 71 transitions, 609 flow [2022-12-06 04:12:11,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-06 04:12:11,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] $Ultimate##0-->L816: Formula: (and (= v_~z~0_28 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_28, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,373 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [380] L796-->L799: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:12:12,427 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:12:52,689 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:12:52,690 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:12:52,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:12:52,691 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:12:52,693 INFO L158 Benchmark]: Toolchain (without parser) took 68659.85ms. Allocated memory was 191.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 165.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 04:12:52,693 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory was 167.8MB in the beginning and 167.6MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:12:52,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.54ms. Allocated memory is still 191.9MB. Free memory was 165.9MB in the beginning and 138.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:12:52,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 191.9MB. Free memory was 138.1MB in the beginning and 135.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:12:52,694 INFO L158 Benchmark]: Boogie Preprocessor took 43.37ms. Allocated memory is still 191.9MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:12:52,694 INFO L158 Benchmark]: RCFGBuilder took 708.34ms. Allocated memory is still 191.9MB. Free memory was 133.4MB in the beginning and 97.2MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 04:12:52,694 INFO L158 Benchmark]: TraceAbstraction took 67234.60ms. Allocated memory was 191.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 96.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 04:12:52,695 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.09ms. Allocated memory is still 191.9MB. Free memory was 167.8MB in the beginning and 167.6MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 614.54ms. Allocated memory is still 191.9MB. Free memory was 165.9MB in the beginning and 138.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 191.9MB. Free memory was 138.1MB in the beginning and 135.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.37ms. Allocated memory is still 191.9MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 708.34ms. Allocated memory is still 191.9MB. Free memory was 133.4MB in the beginning and 97.2MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 67234.60ms. Allocated memory was 191.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 96.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 136 PlacesBefore, 45 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 2052, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1868, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1868, independent: 1796, independent conditional: 0, independent unconditional: 1796, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2124, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1868, unknown conditional: 0, unknown unconditional: 1868] , Statistics on independence cache: Total cache size (in pairs): 2632, Positive cache size: 2589, Positive conditional cache size: 0, Positive unconditional cache size: 2589, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 174, independent conditional: 174, 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: 202, independent: 174, independent conditional: 14, independent unconditional: 160, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 174, independent conditional: 14, independent unconditional: 160, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 174, independent conditional: 14, independent unconditional: 160, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 156, independent conditional: 12, independent unconditional: 144, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 177, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 35, dependent conditional: 9, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 177, unknown conditional: 14, unknown unconditional: 163] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 156, Positive conditional cache size: 12, Positive unconditional cache size: 144, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, 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, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 190, independent: 164, independent conditional: 9, independent unconditional: 155, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 190, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 190, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 190, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 167, Positive conditional cache size: 12, Positive unconditional cache size: 155, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 167, independent conditional: 167, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 194, independent: 167, independent conditional: 21, independent unconditional: 146, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, independent: 167, independent conditional: 13, independent unconditional: 154, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 194, independent: 167, independent conditional: 13, independent unconditional: 154, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 194, independent: 163, independent conditional: 9, independent unconditional: 154, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 171, Positive conditional cache size: 16, Positive unconditional cache size: 155, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 117, independent conditional: 24, independent unconditional: 93, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 117, independent conditional: 16, independent unconditional: 101, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 117, independent conditional: 16, independent unconditional: 101, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 112, independent conditional: 15, independent unconditional: 97, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 10, unknown conditional: 1, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 176, Positive conditional cache size: 17, Positive unconditional cache size: 159, Negative cache size: 31, Negative conditional cache size: 5, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 324, independent: 285, independent conditional: 285, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 324, independent: 285, independent conditional: 72, independent unconditional: 213, dependent: 39, dependent conditional: 1, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 324, independent: 285, independent conditional: 44, independent unconditional: 241, dependent: 39, dependent conditional: 1, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 324, independent: 285, independent conditional: 44, independent unconditional: 241, dependent: 39, dependent conditional: 1, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 10, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 324, independent: 258, independent conditional: 34, independent unconditional: 224, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 29, unknown conditional: 10, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 203, Positive conditional cache size: 27, Positive unconditional cache size: 176, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 274, independent conditional: 274, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311, independent: 274, independent conditional: 72, independent unconditional: 202, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311, independent: 274, independent conditional: 49, independent unconditional: 225, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311, independent: 274, independent conditional: 49, independent unconditional: 225, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 311, independent: 270, independent conditional: 49, independent unconditional: 221, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 207, Positive conditional cache size: 27, Positive unconditional cache size: 180, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 333, independent conditional: 333, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 333, independent conditional: 94, independent unconditional: 239, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 377, independent: 333, independent conditional: 61, independent unconditional: 272, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 377, independent: 333, independent conditional: 61, independent unconditional: 272, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 377, independent: 333, independent conditional: 61, independent unconditional: 272, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 207, Positive conditional cache size: 27, Positive unconditional cache size: 180, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 68 PlacesBefore, 66 PlacesAfterwards, 68 TransitionsBefore, 66 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 875, independent: 763, independent conditional: 763, independent unconditional: 0, dependent: 112, dependent conditional: 112, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 875, independent: 763, independent conditional: 229, independent unconditional: 534, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 875, independent: 763, independent conditional: 190, independent unconditional: 573, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 875, independent: 763, independent conditional: 190, independent unconditional: 573, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 11, 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: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 875, independent: 750, independent conditional: 179, independent unconditional: 571, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 13, unknown conditional: 11, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 289, Positive conditional cache size: 40, Positive unconditional cache size: 249, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 906 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 343, independent conditional: 343, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 405, independent: 343, independent conditional: 78, independent unconditional: 265, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 405, independent: 343, independent conditional: 65, independent unconditional: 278, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 405, independent: 343, independent conditional: 65, independent unconditional: 278, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 405, independent: 342, independent conditional: 64, independent unconditional: 278, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 290, Positive conditional cache size: 41, Positive unconditional cache size: 249, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 524, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 524, independent: 454, independent conditional: 152, independent unconditional: 302, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 524, independent: 454, independent conditional: 138, independent unconditional: 316, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 524, independent: 454, independent conditional: 138, independent unconditional: 316, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 524, independent: 447, independent conditional: 131, independent unconditional: 316, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 297, Positive conditional cache size: 48, Positive unconditional cache size: 249, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 364, independent: 321, independent conditional: 321, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 364, independent: 321, independent conditional: 132, independent unconditional: 189, dependent: 43, dependent conditional: 7, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 364, independent: 321, independent conditional: 107, independent unconditional: 214, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 364, independent: 321, independent conditional: 107, independent unconditional: 214, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 364, independent: 316, independent conditional: 105, independent unconditional: 211, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 302, Positive conditional cache size: 50, Positive unconditional cache size: 252, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 81 PlacesBefore, 80 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 1142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 446, independent: 396, independent conditional: 396, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 446, independent: 396, independent conditional: 290, independent unconditional: 106, dependent: 50, dependent conditional: 14, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 446, independent: 396, independent conditional: 252, independent unconditional: 144, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 446, independent: 396, independent conditional: 252, independent unconditional: 144, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 9, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 446, independent: 386, independent conditional: 243, independent unconditional: 143, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 328, Positive conditional cache size: 61, Positive unconditional cache size: 267, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 81 PlacesBefore, 79 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 1164 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 528, independent: 466, independent conditional: 466, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 528, independent: 466, independent conditional: 289, independent unconditional: 177, dependent: 62, dependent conditional: 23, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 537, independent: 466, independent conditional: 194, independent unconditional: 272, dependent: 71, dependent conditional: 12, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 537, independent: 466, independent conditional: 194, independent unconditional: 272, dependent: 71, dependent conditional: 12, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 537, independent: 462, independent conditional: 192, independent unconditional: 270, dependent: 68, dependent conditional: 9, dependent unconditional: 59, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 402, Positive conditional cache size: 63, Positive unconditional cache size: 339, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 115, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 83 PlacesBefore, 82 PlacesAfterwards, 77 TransitionsBefore, 74 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 360, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 266, independent unconditional: 94, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400, independent: 360, independent conditional: 250, independent unconditional: 110, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 250, independent unconditional: 110, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 400, independent: 341, independent conditional: 231, independent unconditional: 110, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 428, Positive conditional cache size: 83, Positive unconditional cache size: 345, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 184, independent conditional: 184, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 184, independent conditional: 136, independent unconditional: 48, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 184, independent conditional: 108, independent unconditional: 76, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 184, independent conditional: 108, independent unconditional: 76, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 191, independent: 183, independent conditional: 107, independent unconditional: 76, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 429, Positive conditional cache size: 84, Positive unconditional cache size: 345, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.7s, 80 PlacesBefore, 77 PlacesAfterwards, 71 TransitionsBefore, 68 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 311, independent conditional: 311, 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: 319, independent: 311, independent conditional: 239, independent unconditional: 72, 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: 319, independent: 311, independent conditional: 145, independent unconditional: 166, 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: 319, independent: 311, independent conditional: 145, independent unconditional: 166, 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: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 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: 319, independent: 307, independent conditional: 141, independent unconditional: 166, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 557, Positive cache size: 521, Positive conditional cache size: 88, Positive unconditional cache size: 433, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:12:52,722 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...