/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/mix010.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:18:54,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:18:54,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:18:54,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:18:54,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:18:54,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:18:54,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:18:54,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:18:54,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:18:54,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:18:54,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:18:54,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:18:54,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:18:54,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:18:54,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:18:54,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:18:54,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:18:54,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:18:54,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:18:54,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:18:54,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:18:54,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:18:54,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:18:54,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:18:54,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:18:54,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:18:54,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:18:54,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:18:54,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:18:54,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:18:54,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:18:54,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:18:54,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:18:54,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:18:54,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:18:54,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:18:54,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:18:54,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:18:54,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:18:54,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:18:54,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:18:54,797 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-13 09:18:54,824 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:18:54,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:18:54,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:18:54,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:18:54,826 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:18:54,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:18:54,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:18:54,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:18:54,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:18:54,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:18:54,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:18:54,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:18:54,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:18:54,829 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:18:54,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:18:54,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:18:54,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:18:54,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:18:54,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:18:54,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:18:54,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:18:54,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:18:54,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:18:54,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:18:54,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:18:54,831 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:18:54,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:18:54,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:18:54,831 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:18:54,831 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-13 09:18:55,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:18:55,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:18:55,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:18:55,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:18:55,147 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:18:55,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2022-12-13 09:18:56,286 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:18:56,539 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:18:56,539 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2022-12-13 09:18:56,553 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23044631/9957fb90a804470fa21f6aba787efd2c/FLAG420742cae [2022-12-13 09:18:56,567 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23044631/9957fb90a804470fa21f6aba787efd2c [2022-12-13 09:18:56,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:18:56,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:18:56,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:18:56,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:18:56,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:18:56,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:18:56" (1/1) ... [2022-12-13 09:18:56,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f9c45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:56, skipping insertion in model container [2022-12-13 09:18:56,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:18:56" (1/1) ... [2022-12-13 09:18:56,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:18:56,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:18:56,812 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/mix010.oepc.i[945,958] [2022-12-13 09:18:56,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:56,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:56,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:56,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:56,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:56,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:56,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:56,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:18:57,071 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:18:57,081 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/mix010.oepc.i[945,958] [2022-12-13 09:18:57,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:18:57,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:18:57,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:18:57,182 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:18:57,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57 WrapperNode [2022-12-13 09:18:57,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:18:57,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:18:57,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:18:57,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:18:57,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,249 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-13 09:18:57,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:18:57,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:18:57,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:18:57,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:18:57,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:18:57,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:18:57,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:18:57,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:18:57,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (1/1) ... [2022-12-13 09:18:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:18:57,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:18:57,333 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-13 09:18:57,365 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-13 09:18:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:18:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:18:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:18:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:18:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:18:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:18:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:18:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:18:57,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:18:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:18:57,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:18:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:18:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:18:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:18:57,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:18:57,386 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:18:57,530 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:18:57,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:18:57,868 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:18:57,996 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:18:57,996 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:18:58,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:18:57 BoogieIcfgContainer [2022-12-13 09:18:58,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:18:58,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:18:58,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:18:58,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:18:58,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:18:56" (1/3) ... [2022-12-13 09:18:58,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bce5bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:18:58, skipping insertion in model container [2022-12-13 09:18:58,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:57" (2/3) ... [2022-12-13 09:18:58,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bce5bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:18:58, skipping insertion in model container [2022-12-13 09:18:58,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:18:57" (3/3) ... [2022-12-13 09:18:58,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2022-12-13 09:18:58,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:18:58,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:18:58,024 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:18:58,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:18:58,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 09:18:58,245 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 09:18:58,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:18:58,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 09:18:58,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 09:18:58,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-13 09:18:58,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:58,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 09:18:58,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-13 09:18:58,327 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 09:18:58,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:18:58,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 09:18:58,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 09:18:58,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 2216 [2022-12-13 09:19:03,819 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-13 09:19:03,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:19:03,846 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;@170a0006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:19:03,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:19:03,851 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 09:19:03,852 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:03,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:03,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:19:03,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash 497018, now seen corresponding path program 1 times [2022-12-13 09:19:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:03,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072848150] [2022-12-13 09:19:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:04,244 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-13 09:19:04,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:04,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072848150] [2022-12-13 09:19:04,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072848150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:04,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:04,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:04,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483205261] [2022-12-13 09:19:04,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:04,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:04,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:04,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:04,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 68 [2022-12-13 09:19:04,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:04,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:04,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 68 [2022-12-13 09:19:04,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:06,337 INFO L130 PetriNetUnfolder]: 11239/18015 cut-off events. [2022-12-13 09:19:06,337 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 09:19:06,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34042 conditions, 18015 events. 11239/18015 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 142778 event pairs, 1495 based on Foata normal form. 0/10800 useless extension candidates. Maximal degree in co-relation 34031. Up to 13513 conditions per place. [2022-12-13 09:19:06,397 INFO L137 encePairwiseOnDemand]: 64/68 looper letters, 38 selfloop transitions, 2 changer transitions 59/112 dead transitions. [2022-12-13 09:19:06,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 435 flow [2022-12-13 09:19:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-12-13 09:19:06,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2022-12-13 09:19:06,409 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 3 states and 143 transitions. [2022-12-13 09:19:06,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 435 flow [2022-12-13 09:19:06,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:06,415 INFO L231 Difference]: Finished difference. Result has 75 places, 36 transitions, 82 flow [2022-12-13 09:19:06,416 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=75, PETRI_TRANSITIONS=36} [2022-12-13 09:19:06,420 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2022-12-13 09:19:06,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:06,422 INFO L89 Accepts]: Start accepts. Operand has 75 places, 36 transitions, 82 flow [2022-12-13 09:19:06,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:06,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:06,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 36 transitions, 82 flow [2022-12-13 09:19:06,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2022-12-13 09:19:06,442 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 09:19:06,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 89 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:19:06,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2022-12-13 09:19:06,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-13 09:19:06,620 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:06,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-13 09:19:06,622 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 82 flow [2022-12-13 09:19:06,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:06,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:06,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:19:06,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -986073523, now seen corresponding path program 1 times [2022-12-13 09:19:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:06,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460639765] [2022-12-13 09:19:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:06,838 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-13 09:19:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460639765] [2022-12-13 09:19:06,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460639765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:06,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:06,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718776619] [2022-12-13 09:19:06,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:06,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:06,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:06,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:06,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 09:19:06,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-13 09:19:06,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:06,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 09:19:06,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:07,456 INFO L130 PetriNetUnfolder]: 4113/6191 cut-off events. [2022-12-13 09:19:07,456 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2022-12-13 09:19:07,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12487 conditions, 6191 events. 4113/6191 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 32624 event pairs, 1873 based on Foata normal form. 0/4889 useless extension candidates. Maximal degree in co-relation 12477. Up to 5741 conditions per place. [2022-12-13 09:19:07,494 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 36 selfloop transitions, 4 changer transitions 2/50 dead transitions. [2022-12-13 09:19:07,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 200 flow [2022-12-13 09:19:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 09:19:07,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2022-12-13 09:19:07,496 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-13 09:19:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 200 flow [2022-12-13 09:19:07,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:07,499 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 102 flow [2022-12-13 09:19:07,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 09:19:07,500 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 09:19:07,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:07,500 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 102 flow [2022-12-13 09:19:07,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:07,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:07,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 102 flow [2022-12-13 09:19:07,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 102 flow [2022-12-13 09:19:07,514 INFO L130 PetriNetUnfolder]: 14/99 cut-off events. [2022-12-13 09:19:07,515 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 99 events. 14/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 411 event pairs, 6 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 132. Up to 29 conditions per place. [2022-12-13 09:19:07,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 102 flow [2022-12-13 09:19:07,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 09:19:07,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:07,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-13 09:19:07,584 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 102 flow [2022-12-13 09:19:07,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-13 09:19:07,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:07,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:07,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:19:07,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash -198361040, now seen corresponding path program 1 times [2022-12-13 09:19:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:07,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140563372] [2022-12-13 09:19:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:07,790 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-13 09:19:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:07,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140563372] [2022-12-13 09:19:07,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140563372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:07,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:07,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:07,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260709556] [2022-12-13 09:19:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:07,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:07,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:07,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 09:19:07,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:07,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:07,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 09:19:07,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:08,260 INFO L130 PetriNetUnfolder]: 3027/4614 cut-off events. [2022-12-13 09:19:08,260 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2022-12-13 09:19:08,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9951 conditions, 4614 events. 3027/4614 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 23107 event pairs, 867 based on Foata normal form. 84/3944 useless extension candidates. Maximal degree in co-relation 9940. Up to 3273 conditions per place. [2022-12-13 09:19:08,287 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 41 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-13 09:19:08,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 222 flow [2022-12-13 09:19:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 09:19:08,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-13 09:19:08,291 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 102 flow. Second operand 3 states and 66 transitions. [2022-12-13 09:19:08,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 222 flow [2022-12-13 09:19:08,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:08,293 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:08,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 09:19:08,295 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2022-12-13 09:19:08,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:08,295 INFO L89 Accepts]: Start accepts. Operand has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:08,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:08,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:08,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:08,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:08,303 INFO L130 PetriNetUnfolder]: 9/71 cut-off events. [2022-12-13 09:19:08,303 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-13 09:19:08,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 71 events. 9/71 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 264 event pairs, 2 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 105. Up to 21 conditions per place. [2022-12-13 09:19:08,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:08,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-13 09:19:08,316 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:08,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 09:19:08,321 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:08,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:08,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:08,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:08,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:19:08,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1499447336, now seen corresponding path program 1 times [2022-12-13 09:19:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:08,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906921695] [2022-12-13 09:19:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:08,467 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-13 09:19:08,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:08,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906921695] [2022-12-13 09:19:08,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906921695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:08,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:08,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:08,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155751670] [2022-12-13 09:19:08,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:08,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:08,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:08,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 09:19:08,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:08,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:08,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 09:19:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:08,871 INFO L130 PetriNetUnfolder]: 2790/4295 cut-off events. [2022-12-13 09:19:08,872 INFO L131 PetriNetUnfolder]: For 1246/1246 co-relation queries the response was YES. [2022-12-13 09:19:08,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 4295 events. 2790/4295 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 22193 event pairs, 1065 based on Foata normal form. 90/3694 useless extension candidates. Maximal degree in co-relation 9537. Up to 2801 conditions per place. [2022-12-13 09:19:08,896 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2022-12-13 09:19:08,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 238 flow [2022-12-13 09:19:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 09:19:08,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-13 09:19:08,898 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 109 flow. Second operand 3 states and 67 transitions. [2022-12-13 09:19:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 238 flow [2022-12-13 09:19:08,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:08,904 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 112 flow [2022-12-13 09:19:08,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-13 09:19:08,905 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -30 predicate places. [2022-12-13 09:19:08,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:08,905 INFO L89 Accepts]: Start accepts. Operand has 48 places, 37 transitions, 112 flow [2022-12-13 09:19:08,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:08,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:08,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 112 flow [2022-12-13 09:19:08,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 112 flow [2022-12-13 09:19:08,915 INFO L130 PetriNetUnfolder]: 6/65 cut-off events. [2022-12-13 09:19:08,916 INFO L131 PetriNetUnfolder]: For 7/12 co-relation queries the response was YES. [2022-12-13 09:19:08,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 65 events. 6/65 cut-off events. For 7/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 228 event pairs, 1 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 98. Up to 16 conditions per place. [2022-12-13 09:19:08,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 112 flow [2022-12-13 09:19:08,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-13 09:19:08,940 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:08,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 09:19:08,941 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 112 flow [2022-12-13 09:19:08,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:08,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:08,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:08,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:19:08,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash 849158149, now seen corresponding path program 1 times [2022-12-13 09:19:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195022658] [2022-12-13 09:19:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:09,077 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-13 09:19:09,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:09,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195022658] [2022-12-13 09:19:09,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195022658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:09,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:09,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310077712] [2022-12-13 09:19:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:09,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:09,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:09,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:09,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:19:09,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:09,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:09,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:19:09,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:09,389 INFO L130 PetriNetUnfolder]: 2018/3209 cut-off events. [2022-12-13 09:19:09,389 INFO L131 PetriNetUnfolder]: For 941/983 co-relation queries the response was YES. [2022-12-13 09:19:09,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7077 conditions, 3209 events. 2018/3209 cut-off events. For 941/983 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17489 event pairs, 568 based on Foata normal form. 50/2322 useless extension candidates. Maximal degree in co-relation 7063. Up to 2977 conditions per place. [2022-12-13 09:19:09,404 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 35 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-12-13 09:19:09,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 246 flow [2022-12-13 09:19:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 09:19:09,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2022-12-13 09:19:09,406 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 112 flow. Second operand 3 states and 73 transitions. [2022-12-13 09:19:09,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 246 flow [2022-12-13 09:19:09,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:09,408 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:09,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 09:19:09,408 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -30 predicate places. [2022-12-13 09:19:09,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:09,409 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:09,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:09,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:09,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:09,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:09,447 INFO L130 PetriNetUnfolder]: 281/645 cut-off events. [2022-12-13 09:19:09,447 INFO L131 PetriNetUnfolder]: For 135/159 co-relation queries the response was YES. [2022-12-13 09:19:09,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 645 events. 281/645 cut-off events. For 135/159 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 4296 event pairs, 127 based on Foata normal form. 3/359 useless extension candidates. Maximal degree in co-relation 1312. Up to 484 conditions per place. [2022-12-13 09:19:09,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:09,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-13 09:19:09,463 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:09,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 09:19:09,464 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:09,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:09,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:09,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:09,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:19:09,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 688713559, now seen corresponding path program 1 times [2022-12-13 09:19:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741517395] [2022-12-13 09:19:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:09,633 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-13 09:19:09,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:09,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741517395] [2022-12-13 09:19:09,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741517395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:09,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654968578] [2022-12-13 09:19:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:09,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:19:09,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:09,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:09,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:19:09,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:09,859 INFO L130 PetriNetUnfolder]: 1007/1850 cut-off events. [2022-12-13 09:19:09,860 INFO L131 PetriNetUnfolder]: For 508/517 co-relation queries the response was YES. [2022-12-13 09:19:09,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 1850 events. 1007/1850 cut-off events. For 508/517 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10698 event pairs, 163 based on Foata normal form. 135/1450 useless extension candidates. Maximal degree in co-relation 5180. Up to 1207 conditions per place. [2022-12-13 09:19:09,871 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 44 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2022-12-13 09:19:09,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 382 flow [2022-12-13 09:19:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:19:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:19:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-13 09:19:09,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2022-12-13 09:19:09,872 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 174 flow. Second operand 4 states and 100 transitions. [2022-12-13 09:19:09,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 382 flow [2022-12-13 09:19:09,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:09,875 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:09,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2022-12-13 09:19:09,876 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-13 09:19:09,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:09,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:09,877 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:09,877 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:09,877 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:09,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:09,913 INFO L130 PetriNetUnfolder]: 194/528 cut-off events. [2022-12-13 09:19:09,913 INFO L131 PetriNetUnfolder]: For 234/309 co-relation queries the response was YES. [2022-12-13 09:19:09,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 528 events. 194/528 cut-off events. For 234/309 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3681 event pairs, 28 based on Foata normal form. 5/335 useless extension candidates. Maximal degree in co-relation 1528. Up to 346 conditions per place. [2022-12-13 09:19:09,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:09,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-13 09:19:09,922 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:09,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 09:19:09,923 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:09,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:09,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:09,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:09,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:19:09,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash -325955193, now seen corresponding path program 1 times [2022-12-13 09:19:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559938461] [2022-12-13 09:19:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:10,135 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-13 09:19:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:10,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559938461] [2022-12-13 09:19:10,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559938461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:10,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:10,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567069280] [2022-12-13 09:19:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:10,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:10,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:10,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:19:10,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:10,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:10,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:19:10,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:10,332 INFO L130 PetriNetUnfolder]: 584/1130 cut-off events. [2022-12-13 09:19:10,332 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-12-13 09:19:10,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1130 events. 584/1130 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6097 event pairs, 82 based on Foata normal form. 108/865 useless extension candidates. Maximal degree in co-relation 3758. Up to 544 conditions per place. [2022-12-13 09:19:10,340 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 35 selfloop transitions, 28 changer transitions 0/75 dead transitions. [2022-12-13 09:19:10,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 448 flow [2022-12-13 09:19:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 09:19:10,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6411764705882353 [2022-12-13 09:19:10,342 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 276 flow. Second operand 5 states and 109 transitions. [2022-12-13 09:19:10,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 448 flow [2022-12-13 09:19:10,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 398 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 09:19:10,347 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 302 flow [2022-12-13 09:19:10,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-13 09:19:10,348 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2022-12-13 09:19:10,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:10,348 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 302 flow [2022-12-13 09:19:10,349 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:10,349 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:10,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 302 flow [2022-12-13 09:19:10,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 302 flow [2022-12-13 09:19:10,377 INFO L130 PetriNetUnfolder]: 104/312 cut-off events. [2022-12-13 09:19:10,377 INFO L131 PetriNetUnfolder]: For 108/159 co-relation queries the response was YES. [2022-12-13 09:19:10,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 312 events. 104/312 cut-off events. For 108/159 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1796 event pairs, 1 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 974. Up to 199 conditions per place. [2022-12-13 09:19:10,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 302 flow [2022-12-13 09:19:10,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-13 09:19:10,857 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:19:10,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-13 09:19:10,858 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 298 flow [2022-12-13 09:19:10,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:10,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:10,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:10,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:19:10,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:10,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash -453575158, now seen corresponding path program 1 times [2022-12-13 09:19:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:10,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608676420] [2022-12-13 09:19:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:11,113 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-13 09:19:11,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:11,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608676420] [2022-12-13 09:19:11,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608676420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:11,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:11,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596501078] [2022-12-13 09:19:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:11,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:11,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:19:11,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:11,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:11,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:19:11,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:11,382 INFO L130 PetriNetUnfolder]: 1054/1847 cut-off events. [2022-12-13 09:19:11,382 INFO L131 PetriNetUnfolder]: For 2003/2184 co-relation queries the response was YES. [2022-12-13 09:19:11,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 1847 events. 1054/1847 cut-off events. For 2003/2184 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9829 event pairs, 52 based on Foata normal form. 139/1651 useless extension candidates. Maximal degree in co-relation 6277. Up to 773 conditions per place. [2022-12-13 09:19:11,394 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 52 selfloop transitions, 4 changer transitions 34/104 dead transitions. [2022-12-13 09:19:11,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 748 flow [2022-12-13 09:19:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:19:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:19:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 09:19:11,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.578125 [2022-12-13 09:19:11,396 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 298 flow. Second operand 6 states and 111 transitions. [2022-12-13 09:19:11,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 748 flow [2022-12-13 09:19:11,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 104 transitions, 614 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:11,438 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 233 flow [2022-12-13 09:19:11,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-13 09:19:11,440 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2022-12-13 09:19:11,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:11,440 INFO L89 Accepts]: Start accepts. Operand has 54 places, 52 transitions, 233 flow [2022-12-13 09:19:11,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:11,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:11,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 233 flow [2022-12-13 09:19:11,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 233 flow [2022-12-13 09:19:11,463 INFO L130 PetriNetUnfolder]: 103/261 cut-off events. [2022-12-13 09:19:11,463 INFO L131 PetriNetUnfolder]: For 211/223 co-relation queries the response was YES. [2022-12-13 09:19:11,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 261 events. 103/261 cut-off events. For 211/223 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1228 event pairs, 1 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 694. Up to 118 conditions per place. [2022-12-13 09:19:11,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 52 transitions, 233 flow [2022-12-13 09:19:11,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 09:19:11,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:19:11,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 09:19:11,495 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 231 flow [2022-12-13 09:19:11,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:11,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:11,495 INFO L214 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-13 09:19:11,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:19:11,496 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash 270978040, now seen corresponding path program 1 times [2022-12-13 09:19:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224933894] [2022-12-13 09:19:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:11,700 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-13 09:19:11,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:11,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224933894] [2022-12-13 09:19:11,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224933894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:11,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:11,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561572996] [2022-12-13 09:19:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:11,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:11,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:19:11,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:11,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:11,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:19:11,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:11,999 INFO L130 PetriNetUnfolder]: 963/1738 cut-off events. [2022-12-13 09:19:11,999 INFO L131 PetriNetUnfolder]: For 1823/1955 co-relation queries the response was YES. [2022-12-13 09:19:12,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5445 conditions, 1738 events. 963/1738 cut-off events. For 1823/1955 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9944 event pairs, 108 based on Foata normal form. 132/1529 useless extension candidates. Maximal degree in co-relation 5427. Up to 797 conditions per place. [2022-12-13 09:19:12,008 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 41 selfloop transitions, 3 changer transitions 45/102 dead transitions. [2022-12-13 09:19:12,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 102 transitions, 629 flow [2022-12-13 09:19:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:19:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:19:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-13 09:19:12,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2022-12-13 09:19:12,010 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 231 flow. Second operand 6 states and 109 transitions. [2022-12-13 09:19:12,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 102 transitions, 629 flow [2022-12-13 09:19:12,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 623 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:12,030 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 223 flow [2022-12-13 09:19:12,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 09:19:12,031 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-13 09:19:12,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:12,031 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 223 flow [2022-12-13 09:19:12,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:12,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:12,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 223 flow [2022-12-13 09:19:12,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 223 flow [2022-12-13 09:19:12,052 INFO L130 PetriNetUnfolder]: 91/217 cut-off events. [2022-12-13 09:19:12,052 INFO L131 PetriNetUnfolder]: For 206/218 co-relation queries the response was YES. [2022-12-13 09:19:12,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 217 events. 91/217 cut-off events. For 206/218 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 937 event pairs, 1 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 589. Up to 109 conditions per place. [2022-12-13 09:19:12,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 223 flow [2022-12-13 09:19:12,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 09:19:12,604 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:19:12,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 574 [2022-12-13 09:19:12,605 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 215 flow [2022-12-13 09:19:12,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:12,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:12,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:12,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:19:12,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -345139843, now seen corresponding path program 1 times [2022-12-13 09:19:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949004013] [2022-12-13 09:19:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:13,287 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-13 09:19:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:13,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949004013] [2022-12-13 09:19:13,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949004013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:13,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:13,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:19:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349723231] [2022-12-13 09:19:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:13,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:19:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:19:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:19:13,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 09:19:13,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:13,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:13,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 09:19:13,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:13,487 INFO L130 PetriNetUnfolder]: 424/810 cut-off events. [2022-12-13 09:19:13,487 INFO L131 PetriNetUnfolder]: For 1036/1080 co-relation queries the response was YES. [2022-12-13 09:19:13,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 810 events. 424/810 cut-off events. For 1036/1080 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4415 event pairs, 10 based on Foata normal form. 58/668 useless extension candidates. Maximal degree in co-relation 2651. Up to 344 conditions per place. [2022-12-13 09:19:13,492 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 41 selfloop transitions, 4 changer transitions 28/84 dead transitions. [2022-12-13 09:19:13,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 548 flow [2022-12-13 09:19:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:19:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:19:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-13 09:19:13,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-13 09:19:13,493 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 215 flow. Second operand 6 states and 86 transitions. [2022-12-13 09:19:13,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 548 flow [2022-12-13 09:19:13,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 542 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:13,501 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 217 flow [2022-12-13 09:19:13,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 09:19:13,501 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-13 09:19:13,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:13,502 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 217 flow [2022-12-13 09:19:13,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:13,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:13,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 217 flow [2022-12-13 09:19:13,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 217 flow [2022-12-13 09:19:13,521 INFO L130 PetriNetUnfolder]: 99/234 cut-off events. [2022-12-13 09:19:13,521 INFO L131 PetriNetUnfolder]: For 221/229 co-relation queries the response was YES. [2022-12-13 09:19:13,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 234 events. 99/234 cut-off events. For 221/229 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1131 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 684. Up to 118 conditions per place. [2022-12-13 09:19:13,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 217 flow [2022-12-13 09:19:13,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 09:19:13,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd0~0_153 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_436 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd0~0_152 256))))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_437 256) 0)) .cse5)) (.cse1 (and .cse5 .cse4)) (.cse2 (and .cse3 (not (= 0 (mod v_~a$w_buff1_used~0_384 256)))))) (and (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_152 1) (= v_~__unbuffered_p1_EAX~0_156 1) (= v_~__unbuffered_p1_EBX~0_167 0) (= v_~__unbuffered_p0_EAX~0_190 0) (= v_~__unbuffered_p2_EBX~0_173 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_166) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_166 256)) (= (mod v_~main$tmp_guard0~0_118 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_118) (= (ite .cse0 0 v_~a$w_buff0_used~0_437) v_~a$w_buff0_used~0_436) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121|) (= v_~a$r_buff0_thd0~0_151 (ite .cse1 0 v_~a$r_buff0_thd0~0_152)) (= v_~a~0_322 (ite .cse0 v_~a$w_buff0~0_253 (ite .cse2 v_~a$w_buff1~0_217 v_~a~0_323))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| 0) (= v_~a$r_buff1_thd0~0_152 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_383 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd0~0_151 256) 0)))) 0 v_~a$r_buff1_thd0~0_153)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= v_~a$w_buff1_used~0_383 (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_384)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_167, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_173, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_437, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_152, ~a~0=v_~a~0_323, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_156, ~a$w_buff1~0=v_~a$w_buff1~0_217, ~a$w_buff0~0=v_~a$w_buff0~0_253, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_153, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_384} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_121|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_167, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_173, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_93|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_436, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_166, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_118, ~a~0=v_~a~0_322, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_190, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_156, ~a$w_buff1~0=v_~a$w_buff1~0_217, ~a$w_buff0~0=v_~a$w_buff0~0_253, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_152, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_383, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [507] $Ultimate##0-->L764: Formula: (and (= v_~a$r_buff0_thd3~0_212 v_~a$r_buff1_thd3~0_231) (= |v_P0Thread1of1ForFork1_~arg#1.base_40| |v_P0Thread1of1ForFork1_#in~arg#1.base_40|) (= (ite (not (and (not (= (mod v_~a$w_buff1_used~0_405 256) 0)) (not (= (mod v_~a$w_buff0_used~0_458 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (= v_~a$w_buff0~0_264 v_~a$w_buff1~0_227) (= |v_P0Thread1of1ForFork1_~arg#1.offset_40| |v_P0Thread1of1ForFork1_#in~arg#1.offset_40|) (= v_~x~0_93 v_~__unbuffered_p0_EAX~0_197) (= v_~a$w_buff0_used~0_458 1) (= v_~a$r_buff0_thd2~0_119 v_~a$r_buff1_thd2~0_129) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| 0)) (= v_~a$r_buff0_thd0~0_155 v_~a$r_buff1_thd0~0_156) (= v_~a$w_buff0_used~0_459 v_~a$w_buff1_used~0_405) (= v_~a$w_buff0~0_263 1) (= v_~a$r_buff0_thd1~0_157 v_~a$r_buff1_thd1~0_118) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (= v_~a$r_buff0_thd1~0_156 1)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_40|, ~a$w_buff0~0=v_~a$w_buff0~0_264, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_119, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_212, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_459, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_157, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_40|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, ~x~0=v_~x~0_93} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_40|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_118, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_231, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_119, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_212, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_156, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_40|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_40|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_197, ~a$w_buff1~0=v_~a$w_buff1~0_227, ~a$w_buff0~0=v_~a$w_buff0~0_263, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_156, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_405, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44|, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1] [2022-12-13 09:19:14,731 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:19:14,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1230 [2022-12-13 09:19:14,732 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 255 flow [2022-12-13 09:19:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:14,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:14,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:14,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:19:14,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 688689816, now seen corresponding path program 1 times [2022-12-13 09:19:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:14,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896036644] [2022-12-13 09:19:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:19:14,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:19:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:19:14,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:19:14,822 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:19:14,823 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:19:14,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:19:14,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:19:14,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:19:14,825 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:14,829 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:19:14,830 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:19:14,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:19:14 BasicIcfg [2022-12-13 09:19:14,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:19:14,880 INFO L158 Benchmark]: Toolchain (without parser) took 18309.93ms. Allocated memory was 179.3MB in the beginning and 839.9MB in the end (delta: 660.6MB). Free memory was 155.3MB in the beginning and 602.2MB in the end (delta: -446.9MB). Peak memory consumption was 215.0MB. Max. memory is 8.0GB. [2022-12-13 09:19:14,880 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 156.9MB in the beginning and 156.8MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:19:14,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.33ms. Allocated memory is still 179.3MB. Free memory was 155.0MB in the beginning and 127.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 09:19:14,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.23ms. Allocated memory is still 179.3MB. Free memory was 127.7MB in the beginning and 125.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:19:14,881 INFO L158 Benchmark]: Boogie Preprocessor took 44.20ms. Allocated memory is still 179.3MB. Free memory was 125.1MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:19:14,881 INFO L158 Benchmark]: RCFGBuilder took 704.74ms. Allocated memory is still 179.3MB. Free memory was 123.5MB in the beginning and 88.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 09:19:14,882 INFO L158 Benchmark]: TraceAbstraction took 16877.49ms. Allocated memory was 179.3MB in the beginning and 839.9MB in the end (delta: 660.6MB). Free memory was 87.9MB in the beginning and 602.2MB in the end (delta: -514.3MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. [2022-12-13 09:19:14,883 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 156.9MB in the beginning and 156.8MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 612.33ms. Allocated memory is still 179.3MB. Free memory was 155.0MB in the beginning and 127.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.23ms. Allocated memory is still 179.3MB. Free memory was 127.7MB in the beginning and 125.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.20ms. Allocated memory is still 179.3MB. Free memory was 125.1MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 704.74ms. Allocated memory is still 179.3MB. Free memory was 123.5MB in the beginning and 88.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16877.49ms. Allocated memory was 179.3MB in the beginning and 839.9MB in the end (delta: 660.6MB). Free memory was 87.9MB in the beginning and 602.2MB in the end (delta: -514.3MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 120 PlacesBefore, 78 PlacesAfterwards, 112 TransitionsBefore, 68 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3822, independent: 3555, independent conditional: 3555, independent unconditional: 0, dependent: 267, dependent conditional: 267, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2332, independent: 2262, independent conditional: 0, independent unconditional: 2262, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2332, independent: 2262, independent conditional: 0, independent unconditional: 2262, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2332, independent: 2237, independent conditional: 0, independent unconditional: 2237, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 337, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3822, independent: 1293, independent conditional: 1293, independent unconditional: 0, dependent: 197, dependent conditional: 197, dependent unconditional: 0, unknown: 2332, unknown conditional: 2332, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2332, Positive cache size: 2262, Positive conditional cache size: 2262, Positive unconditional cache size: 0, Negative cache size: 70, Negative conditional cache size: 70, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 337, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 269, independent: 237, independent conditional: 24, independent unconditional: 213, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 269, independent: 237, independent conditional: 24, independent unconditional: 213, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 269, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 132, dependent conditional: 19, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 337, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 269, unknown conditional: 269, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 237, Positive conditional cache size: 237, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 339, independent: 306, independent conditional: 306, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 5, independent unconditional: 65, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 5, independent unconditional: 65, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 1, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 339, independent: 236, independent conditional: 236, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 80, unknown conditional: 80, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 307, Positive conditional cache size: 307, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 322, independent: 288, independent conditional: 288, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 322, independent: 271, independent conditional: 271, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 324, Positive conditional cache size: 324, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 296, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 296, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 336, Positive conditional cache size: 336, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 218, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 6, independent unconditional: 14, 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: 22, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 356, Positive conditional cache size: 356, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 217, independent conditional: 217, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 258, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 362, Positive conditional cache size: 362, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 52 PlacesBefore, 50 PlacesAfterwards, 55 TransitionsBefore, 53 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 560, independent: 480, independent conditional: 480, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 560, independent: 464, independent conditional: 464, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 378, Positive conditional cache size: 378, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 475, independent: 403, independent conditional: 403, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 31, independent conditional: 19, independent unconditional: 12, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 31, independent conditional: 19, independent unconditional: 12, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 475, independent: 372, independent conditional: 372, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 409, Positive conditional cache size: 409, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 52 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 44 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 476, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 80, independent conditional: 60, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 84, independent: 80, independent conditional: 60, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 84, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 84, unknown conditional: 84, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 489, Positive conditional cache size: 489, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 48 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 362, independent conditional: 362, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 48, independent conditional: 40, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 48, independent conditional: 40, independent unconditional: 8, 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: 50, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 594, Positive cache size: 537, Positive conditional cache size: 537, Positive unconditional cache size: 0, Negative cache size: 57, Negative conditional cache size: 57, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257, ((void *)0), P0, ((void *)0))=0, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=1, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t259, ((void *)0), P2, ((void *)0))=2, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 [L809] 3 __unbuffered_p2_EAX = z [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 822 IncrementalHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 23 mSDtfsCounter, 822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:19:14,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...