/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:47:59,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:47:59,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:47:59,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:47:59,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:47:59,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:47:59,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:47:59,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:47:59,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:47:59,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:47:59,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:47:59,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:47:59,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:47:59,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:47:59,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:47:59,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:47:59,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:47:59,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:47:59,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:47:59,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:47:59,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:47:59,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:47:59,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:47:59,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:47:59,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:47:59,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:47:59,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:47:59,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:47:59,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:47:59,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:47:59,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:47:59,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:47:59,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:47:59,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:47:59,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:47:59,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:47:59,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:47:59,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:47:59,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:47:59,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:47:59,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:47:59,704 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-RepeatedSemanticLbe.epf [2022-12-13 00:47:59,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:47:59,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:47:59,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:47:59,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:47:59,731 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:47:59,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:47:59,731 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:47:59,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:47:59,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:47:59,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:47:59,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:47:59,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:47:59,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:47:59,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:47:59,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:47:59,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:47:59,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:47:59,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:47:59,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:47:59,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:47:59,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:47:59,734 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 00:47:59,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:48:00,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:48:00,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:48:00,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:48:00,009 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:48:00,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2022-12-13 00:48:00,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:48:01,186 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:48:01,186 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2022-12-13 00:48:01,239 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfc82bd2/fbde03e4e5c84e33b7a1915128580039/FLAGf4ea14473 [2022-12-13 00:48:01,250 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfc82bd2/fbde03e4e5c84e33b7a1915128580039 [2022-12-13 00:48:01,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:48:01,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:48:01,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:48:01,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:48:01,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:48:01,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72145579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01, skipping insertion in model container [2022-12-13 00:48:01,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:48:01,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:48:01,405 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/safe002_rmo.oepc.i[993,1006] [2022-12-13 00:48:01,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:48:01,632 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:48:01,641 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/safe002_rmo.oepc.i[993,1006] [2022-12-13 00:48:01,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:01,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:01,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:48:01,718 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:48:01,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01 WrapperNode [2022-12-13 00:48:01,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:48:01,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:48:01,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:48:01,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:48:01,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,771 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-13 00:48:01,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:48:01,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:48:01,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:48:01,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:48:01,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,793 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:48:01,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:48:01,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:48:01,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:48:01,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (1/1) ... [2022-12-13 00:48:01,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:48:01,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:48:01,838 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 00:48:01,844 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 00:48:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:48:01,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:48:01,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:48:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:48:01,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:48:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:48:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:48:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:48:01,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:48:01,866 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 00:48:01,990 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:48:01,992 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:48:02,389 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:48:02,661 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:48:02,661 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:48:02,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:02 BoogieIcfgContainer [2022-12-13 00:48:02,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:48:02,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:48:02,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:48:02,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:48:02,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:48:01" (1/3) ... [2022-12-13 00:48:02,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bfe3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:02, skipping insertion in model container [2022-12-13 00:48:02,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:01" (2/3) ... [2022-12-13 00:48:02,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bfe3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:02, skipping insertion in model container [2022-12-13 00:48:02,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:02" (3/3) ... [2022-12-13 00:48:02,671 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2022-12-13 00:48:02,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:48:02,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:48:02,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:48:02,744 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:48:02,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:48:02,832 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:48:02,832 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:02,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:48:02,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:48:02,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:02,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:02,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:02,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:02,909 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 00:48:02,909 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:02,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:48:02,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:02,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-13 00:48:11,206 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 00:48:11,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:48:11,222 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;@4687cd9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:48:11,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:48:11,227 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:48:11,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:11,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:11,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:11,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1030704551, now seen corresponding path program 1 times [2022-12-13 00:48:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:11,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433054454] [2022-12-13 00:48:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:11,398 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 00:48:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:11,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433054454] [2022-12-13 00:48:11,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433054454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:11,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:11,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:11,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389917144] [2022-12-13 00:48:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:11,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:48:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:11,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:48:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:48:11,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:48:11,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:11,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:11,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:48:11,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:11,682 INFO L130 PetriNetUnfolder]: 909/1443 cut-off events. [2022-12-13 00:48:11,682 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 00:48:11,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1443 events. 909/1443 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7299 event pairs, 909 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 2845. Up to 1359 conditions per place. [2022-12-13 00:48:11,691 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 20 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 00:48:11,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 107 flow [2022-12-13 00:48:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:48:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:48:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-13 00:48:11,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 00:48:11,699 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 39 transitions. [2022-12-13 00:48:11,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 107 flow [2022-12-13 00:48:11,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:11,702 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 00:48:11,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 00:48:11,705 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 00:48:11,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:11,706 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 00:48:11,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:11,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:11,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 00:48:11,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 00:48:11,712 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:48:11,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:11,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:48:11,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 00:48:11,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 00:48:11,866 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:11,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 00:48:11,868 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 00:48:11,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:11,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:11,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:11,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:48:11,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:11,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1630361540, now seen corresponding path program 1 times [2022-12-13 00:48:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:11,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639711234] [2022-12-13 00:48:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:12,184 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 00:48:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639711234] [2022-12-13 00:48:12,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639711234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:12,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:12,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382081178] [2022-12-13 00:48:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:12,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:12,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:12,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 00:48:12,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:12,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:12,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 00:48:12,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:12,390 INFO L130 PetriNetUnfolder]: 858/1444 cut-off events. [2022-12-13 00:48:12,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:12,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 1444 events. 858/1444 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7828 event pairs, 202 based on Foata normal form. 20/1188 useless extension candidates. Maximal degree in co-relation 2775. Up to 1037 conditions per place. [2022-12-13 00:48:12,399 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 27 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-13 00:48:12,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 140 flow [2022-12-13 00:48:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 00:48:12,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 00:48:12,400 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 57 transitions. [2022-12-13 00:48:12,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 140 flow [2022-12-13 00:48:12,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:48:12,402 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:12,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 00:48:12,403 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 00:48:12,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:12,403 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:12,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:12,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:12,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:12,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:12,413 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:48:12,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:12,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:48:12,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:12,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 00:48:12,416 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:12,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 00:48:12,418 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:12,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:12,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:12,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:12,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:48:12,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash 998398729, now seen corresponding path program 1 times [2022-12-13 00:48:12,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832989619] [2022-12-13 00:48:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:12,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:13,191 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 00:48:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832989619] [2022-12-13 00:48:13,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832989619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:13,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:13,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45553519] [2022-12-13 00:48:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:13,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:13,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:48:13,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 00:48:13,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:13,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:48:13,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:13,522 INFO L130 PetriNetUnfolder]: 1409/2202 cut-off events. [2022-12-13 00:48:13,523 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-13 00:48:13,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4609 conditions, 2202 events. 1409/2202 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11756 event pairs, 1082 based on Foata normal form. 24/1847 useless extension candidates. Maximal degree in co-relation 4598. Up to 1888 conditions per place. [2022-12-13 00:48:13,533 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 27 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-13 00:48:13,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 164 flow [2022-12-13 00:48:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 00:48:13,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2022-12-13 00:48:13,534 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 72 flow. Second operand 4 states and 63 transitions. [2022-12-13 00:48:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 164 flow [2022-12-13 00:48:13,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:13,535 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 111 flow [2022-12-13 00:48:13,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 00:48:13,536 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-13 00:48:13,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:13,536 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 111 flow [2022-12-13 00:48:13,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:13,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:13,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 111 flow [2022-12-13 00:48:13,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 111 flow [2022-12-13 00:48:13,552 INFO L130 PetriNetUnfolder]: 39/137 cut-off events. [2022-12-13 00:48:13,553 INFO L131 PetriNetUnfolder]: For 17/31 co-relation queries the response was YES. [2022-12-13 00:48:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 137 events. 39/137 cut-off events. For 17/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 657 event pairs, 18 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 245. Up to 69 conditions per place. [2022-12-13 00:48:13,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 111 flow [2022-12-13 00:48:13,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 00:48:13,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] L792-->L794: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [687] $Ultimate##0-->L825: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse4 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse8 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse6 (not .cse16)) (.cse5 (not .cse13)) (.cse12 (select |v_#memory_int_339| |v_~#y~0.base_220|)) (.cse15 (and .cse13 .cse4)) (.cse14 (and .cse7 .cse13))) (let ((.cse2 (or .cse16 .cse15 .cse14)) (.cse0 (select .cse12 |v_~#y~0.offset_220|)) (.cse3 (and .cse6 .cse5)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse1 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (= v_~y$mem_tmp~0_64 .cse0) (= v_~y$w_buff0_used~0_279 (ite .cse1 v_~y$w_buff0_used~0_280 (ite .cse2 v_~y$w_buff0_used~0_280 (ite .cse3 0 v_~y$w_buff0_used~0_280)))) (or (and .cse2 (= |v_P2_#t~mem17_34| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_34| .cse0)) (and (or (not .cse4) .cse5) .cse6 (or .cse5 (not .cse7)) (= (ite .cse3 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32) (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_34|))) (or (and (= |v_P2_#t~ite21_37| |v_P2_#t~mem20_34|) (= |v_P2_#t~mem20_34| v_~__unbuffered_p2_EAX~0_32) .cse8) (and (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_34|) (= |v_P2_#t~ite21_37| v_~y$mem_tmp~0_64) .cse1)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse1 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse7 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse12 |v_~#y~0.offset_220| |v_P2_#t~ite21_37|)) |v_#memory_int_338|) (= v_~y$flush_delayed~0_106 0) (= (ite .cse1 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse5) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse1 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~ite21_37|, |v_P2_#t~mem17_34|, |v_P2_#t~mem20_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-13 00:48:14,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] L794-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_251 256) 0))) (.cse2 (not .cse10)) (.cse9 (= (mod v_~y$w_buff1_used~0_253 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd2~0_30 256) 0)) (.cse11 (= (mod v_~y$w_buff0_used~0_252 256) 0))) (let ((.cse3 (not .cse11)) (.cse5 (select |v_#memory_int_299| |v_~#y~0.base_206|)) (.cse0 (not .cse8)) (.cse7 (not .cse9)) (.cse4 (and .cse1 .cse2))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_252 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29) (= v_~y$w_buff0_used~0_251 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_252)) (= v_~y$r_buff0_thd2~0_31 (ite .cse4 0 v_~y$r_buff0_thd2~0_32)) (= (store |v_#memory_int_299| |v_~#y~0.base_206| (store .cse5 |v_~#y~0.offset_206| |v_P1_#t~ite13_27|)) |v_#memory_int_298|) (let ((.cse6 (= |v_P1Thread1of1ForFork2_#t~mem11_1| |v_P1_#t~mem11_30|))) (or (and (= |v_P1Thread1of1ForFork2_#t~ite12_1| |v_P1_#t~ite12_27|) (= |v_P1_#t~ite13_27| v_~y$w_buff0~0_116) .cse6 .cse2 .cse3) (and (= |v_P1_#t~ite12_27| |v_P1_#t~ite13_27|) (or (and .cse0 (= v_~y$w_buff1~0_132 |v_P1_#t~ite12_27|) .cse6 .cse7) (and (= |v_P1_#t~ite12_27| |v_P1_#t~mem11_30|) (= (select .cse5 |v_~#y~0.offset_206|) |v_P1_#t~mem11_30|) (or .cse8 .cse9))) (or .cse10 .cse11)))) (= (ite (or (and .cse0 .cse7) .cse4) 0 v_~y$w_buff1_used~0_253) v_~y$w_buff1_used~0_252))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_252, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_1|, #memory_int=|v_#memory_int_299|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, ~#y~0.base=|v_~#y~0.base_206|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_251, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, #memory_int=|v_#memory_int_298|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_252} AuxVars[|v_P1_#t~mem11_30|, |v_P1_#t~ite12_27|, |v_P1_#t~ite13_27|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~mem11, #memory_int, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ~y$w_buff1_used~0] and [687] $Ultimate##0-->L825: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse4 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse8 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse6 (not .cse16)) (.cse5 (not .cse13)) (.cse12 (select |v_#memory_int_339| |v_~#y~0.base_220|)) (.cse15 (and .cse13 .cse4)) (.cse14 (and .cse7 .cse13))) (let ((.cse2 (or .cse16 .cse15 .cse14)) (.cse0 (select .cse12 |v_~#y~0.offset_220|)) (.cse3 (and .cse6 .cse5)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse1 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (= v_~y$mem_tmp~0_64 .cse0) (= v_~y$w_buff0_used~0_279 (ite .cse1 v_~y$w_buff0_used~0_280 (ite .cse2 v_~y$w_buff0_used~0_280 (ite .cse3 0 v_~y$w_buff0_used~0_280)))) (or (and .cse2 (= |v_P2_#t~mem17_34| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_34| .cse0)) (and (or (not .cse4) .cse5) .cse6 (or .cse5 (not .cse7)) (= (ite .cse3 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32) (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_34|))) (or (and (= |v_P2_#t~ite21_37| |v_P2_#t~mem20_34|) (= |v_P2_#t~mem20_34| v_~__unbuffered_p2_EAX~0_32) .cse8) (and (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_34|) (= |v_P2_#t~ite21_37| v_~y$mem_tmp~0_64) .cse1)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse1 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse7 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse12 |v_~#y~0.offset_220| |v_P2_#t~ite21_37|)) |v_#memory_int_338|) (= v_~y$flush_delayed~0_106 0) (= (ite .cse1 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse5) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse1 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~ite21_37|, |v_P2_#t~mem17_34|, |v_P2_#t~mem20_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-13 00:48:15,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] L825-->L827: Formula: (= |v_#memory_int_25| (store |v_#memory_int_26| |v_~#y~0.base_19| (store (select |v_#memory_int_26| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2))) InVars {#memory_int=|v_#memory_int_26|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [687] $Ultimate##0-->L825: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse4 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse8 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse6 (not .cse16)) (.cse5 (not .cse13)) (.cse12 (select |v_#memory_int_339| |v_~#y~0.base_220|)) (.cse15 (and .cse13 .cse4)) (.cse14 (and .cse7 .cse13))) (let ((.cse2 (or .cse16 .cse15 .cse14)) (.cse0 (select .cse12 |v_~#y~0.offset_220|)) (.cse3 (and .cse6 .cse5)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse1 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (= v_~y$mem_tmp~0_64 .cse0) (= v_~y$w_buff0_used~0_279 (ite .cse1 v_~y$w_buff0_used~0_280 (ite .cse2 v_~y$w_buff0_used~0_280 (ite .cse3 0 v_~y$w_buff0_used~0_280)))) (or (and .cse2 (= |v_P2_#t~mem17_34| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_34| .cse0)) (and (or (not .cse4) .cse5) .cse6 (or .cse5 (not .cse7)) (= (ite .cse3 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32) (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_34|))) (or (and (= |v_P2_#t~ite21_37| |v_P2_#t~mem20_34|) (= |v_P2_#t~mem20_34| v_~__unbuffered_p2_EAX~0_32) .cse8) (and (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_34|) (= |v_P2_#t~ite21_37| v_~y$mem_tmp~0_64) .cse1)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse1 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse7 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse12 |v_~#y~0.offset_220| |v_P2_#t~ite21_37|)) |v_#memory_int_338|) (= v_~y$flush_delayed~0_106 0) (= (ite .cse1 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse5) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse1 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~ite21_37|, |v_P2_#t~mem17_34|, |v_P2_#t~mem20_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-13 00:48:16,010 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:48:16,011 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2475 [2022-12-13 00:48:16,011 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 117 flow [2022-12-13 00:48:16,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 00:48:16,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:16,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:48:16,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 828539454, now seen corresponding path program 1 times [2022-12-13 00:48:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:16,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348252807] [2022-12-13 00:48:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:16,552 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 00:48:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:16,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348252807] [2022-12-13 00:48:16,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348252807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:16,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:16,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723757149] [2022-12-13 00:48:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:16,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:16,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:16,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:16,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:48:16,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 00:48:16,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:16,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:48:16,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:16,848 INFO L130 PetriNetUnfolder]: 1433/2390 cut-off events. [2022-12-13 00:48:16,848 INFO L131 PetriNetUnfolder]: For 845/845 co-relation queries the response was YES. [2022-12-13 00:48:16,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5396 conditions, 2390 events. 1433/2390 cut-off events. For 845/845 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14562 event pairs, 776 based on Foata normal form. 90/1988 useless extension candidates. Maximal degree in co-relation 5384. Up to 1098 conditions per place. [2022-12-13 00:48:16,855 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 31 selfloop transitions, 4 changer transitions 13/55 dead transitions. [2022-12-13 00:48:16,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 264 flow [2022-12-13 00:48:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 00:48:16,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2022-12-13 00:48:16,856 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 117 flow. Second operand 4 states and 75 transitions. [2022-12-13 00:48:16,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 264 flow [2022-12-13 00:48:16,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:16,858 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2022-12-13 00:48:16,858 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-13 00:48:16,858 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2022-12-13 00:48:16,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:16,859 INFO L89 Accepts]: Start accepts. Operand has 44 places, 31 transitions, 112 flow [2022-12-13 00:48:16,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:16,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:16,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 112 flow [2022-12-13 00:48:16,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 112 flow [2022-12-13 00:48:16,871 INFO L130 PetriNetUnfolder]: 16/95 cut-off events. [2022-12-13 00:48:16,871 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-12-13 00:48:16,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 95 events. 16/95 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 389 event pairs, 10 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 177. Up to 35 conditions per place. [2022-12-13 00:48:16,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 112 flow [2022-12-13 00:48:16,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 00:48:16,879 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:16,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 00:48:16,880 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2022-12-13 00:48:16,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 00:48:16,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:16,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:16,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:48:16,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash 885589374, now seen corresponding path program 2 times [2022-12-13 00:48:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:16,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613064279] [2022-12-13 00:48:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:17,536 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 00:48:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613064279] [2022-12-13 00:48:17,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613064279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:17,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008586402] [2022-12-13 00:48:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:17,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:48:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:48:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:48:17,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:48:17,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 00:48:17,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:17,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:48:17,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:17,789 INFO L130 PetriNetUnfolder]: 638/1108 cut-off events. [2022-12-13 00:48:17,789 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-12-13 00:48:17,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1108 events. 638/1108 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6201 event pairs, 231 based on Foata normal form. 90/927 useless extension candidates. Maximal degree in co-relation 2660. Up to 751 conditions per place. [2022-12-13 00:48:17,794 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 28 selfloop transitions, 4 changer transitions 19/57 dead transitions. [2022-12-13 00:48:17,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 292 flow [2022-12-13 00:48:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 00:48:17,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 00:48:17,798 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 5 states and 87 transitions. [2022-12-13 00:48:17,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 292 flow [2022-12-13 00:48:17,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 283 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:17,802 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 127 flow [2022-12-13 00:48:17,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2022-12-13 00:48:17,804 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2022-12-13 00:48:17,804 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:17,804 INFO L89 Accepts]: Start accepts. Operand has 49 places, 30 transitions, 127 flow [2022-12-13 00:48:17,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:17,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:17,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 30 transitions, 127 flow [2022-12-13 00:48:17,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 30 transitions, 127 flow [2022-12-13 00:48:17,817 INFO L130 PetriNetUnfolder]: 15/78 cut-off events. [2022-12-13 00:48:17,818 INFO L131 PetriNetUnfolder]: For 98/102 co-relation queries the response was YES. [2022-12-13 00:48:17,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 78 events. 15/78 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 296 event pairs, 14 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 174. Up to 29 conditions per place. [2022-12-13 00:48:17,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 30 transitions, 127 flow [2022-12-13 00:48:17,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 00:48:17,890 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:48:17,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 00:48:17,891 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 125 flow [2022-12-13 00:48:17,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 00:48:17,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:17,891 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:17,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:48:17,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1707270635, now seen corresponding path program 1 times [2022-12-13 00:48:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:17,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552759771] [2022-12-13 00:48:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:18,957 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 00:48:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:18,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552759771] [2022-12-13 00:48:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552759771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:18,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:18,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:48:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411057938] [2022-12-13 00:48:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:18,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:48:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:48:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:48:18,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:48:18,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 00:48:18,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:18,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:48:18,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:19,251 INFO L130 PetriNetUnfolder]: 677/1128 cut-off events. [2022-12-13 00:48:19,251 INFO L131 PetriNetUnfolder]: For 1685/1685 co-relation queries the response was YES. [2022-12-13 00:48:19,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 1128 events. 677/1128 cut-off events. For 1685/1685 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5750 event pairs, 285 based on Foata normal form. 21/907 useless extension candidates. Maximal degree in co-relation 3108. Up to 847 conditions per place. [2022-12-13 00:48:19,257 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 36 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2022-12-13 00:48:19,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 311 flow [2022-12-13 00:48:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:48:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:48:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 00:48:19,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2022-12-13 00:48:19,258 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 125 flow. Second operand 6 states and 85 transitions. [2022-12-13 00:48:19,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 311 flow [2022-12-13 00:48:19,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 288 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 00:48:19,261 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 198 flow [2022-12-13 00:48:19,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 00:48:19,261 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-13 00:48:19,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:19,261 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 198 flow [2022-12-13 00:48:19,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:19,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:19,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 198 flow [2022-12-13 00:48:19,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 198 flow [2022-12-13 00:48:19,275 INFO L130 PetriNetUnfolder]: 22/127 cut-off events. [2022-12-13 00:48:19,276 INFO L131 PetriNetUnfolder]: For 161/172 co-relation queries the response was YES. [2022-12-13 00:48:19,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 127 events. 22/127 cut-off events. For 161/172 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 647 event pairs, 8 based on Foata normal form. 5/101 useless extension candidates. Maximal degree in co-relation 310. Up to 39 conditions per place. [2022-12-13 00:48:19,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 198 flow [2022-12-13 00:48:19,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-13 00:48:19,297 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:19,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 00:48:19,298 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 198 flow [2022-12-13 00:48:19,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 00:48:19,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:19,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:19,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:48:19,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1220364573, now seen corresponding path program 2 times [2022-12-13 00:48:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426733154] [2022-12-13 00:48:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:20,405 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 00:48:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:20,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426733154] [2022-12-13 00:48:20,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426733154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:20,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:20,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 00:48:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569936747] [2022-12-13 00:48:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:20,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:48:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:20,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:48:20,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:48:20,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:48:20,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 198 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 00:48:20,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:20,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:48:20,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:20,653 INFO L130 PetriNetUnfolder]: 654/1112 cut-off events. [2022-12-13 00:48:20,653 INFO L131 PetriNetUnfolder]: For 2002/2002 co-relation queries the response was YES. [2022-12-13 00:48:20,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1112 events. 654/1112 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5834 event pairs, 173 based on Foata normal form. 12/888 useless extension candidates. Maximal degree in co-relation 3327. Up to 662 conditions per place. [2022-12-13 00:48:20,659 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 40 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2022-12-13 00:48:20,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 411 flow [2022-12-13 00:48:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-13 00:48:20,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 00:48:20,661 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 198 flow. Second operand 5 states and 70 transitions. [2022-12-13 00:48:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 411 flow [2022-12-13 00:48:20,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 388 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 00:48:20,665 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 270 flow [2022-12-13 00:48:20,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 00:48:20,666 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-13 00:48:20,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:20,666 INFO L89 Accepts]: Start accepts. Operand has 55 places, 43 transitions, 270 flow [2022-12-13 00:48:20,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:20,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:20,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 43 transitions, 270 flow [2022-12-13 00:48:20,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 270 flow [2022-12-13 00:48:20,682 INFO L130 PetriNetUnfolder]: 26/131 cut-off events. [2022-12-13 00:48:20,682 INFO L131 PetriNetUnfolder]: For 279/284 co-relation queries the response was YES. [2022-12-13 00:48:20,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 131 events. 26/131 cut-off events. For 279/284 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 670 event pairs, 7 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 372. Up to 30 conditions per place. [2022-12-13 00:48:20,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 270 flow [2022-12-13 00:48:20,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-13 00:48:20,691 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:20,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:48:20,693 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 270 flow [2022-12-13 00:48:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 00:48:20,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:20,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:20,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:48:20,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1334981598, now seen corresponding path program 1 times [2022-12-13 00:48:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:20,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743618501] [2022-12-13 00:48:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743618501] [2022-12-13 00:48:20,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743618501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:20,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:20,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11343508] [2022-12-13 00:48:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:20,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:20,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:20,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:20,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:48:20,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:20,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:20,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:48:20,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:21,095 INFO L130 PetriNetUnfolder]: 1200/1978 cut-off events. [2022-12-13 00:48:21,095 INFO L131 PetriNetUnfolder]: For 5180/5199 co-relation queries the response was YES. [2022-12-13 00:48:21,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5908 conditions, 1978 events. 1200/1978 cut-off events. For 5180/5199 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 11969 event pairs, 415 based on Foata normal form. 196/1393 useless extension candidates. Maximal degree in co-relation 5885. Up to 1540 conditions per place. [2022-12-13 00:48:21,106 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 57 selfloop transitions, 17 changer transitions 12/94 dead transitions. [2022-12-13 00:48:21,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 689 flow [2022-12-13 00:48:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 00:48:21,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-13 00:48:21,108 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 270 flow. Second operand 5 states and 88 transitions. [2022-12-13 00:48:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 689 flow [2022-12-13 00:48:21,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 680 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:21,112 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 374 flow [2022-12-13 00:48:21,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-13 00:48:21,112 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2022-12-13 00:48:21,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:21,113 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 374 flow [2022-12-13 00:48:21,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:21,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:21,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 374 flow [2022-12-13 00:48:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 56 transitions, 374 flow [2022-12-13 00:48:21,195 INFO L130 PetriNetUnfolder]: 669/1234 cut-off events. [2022-12-13 00:48:21,195 INFO L131 PetriNetUnfolder]: For 1522/1620 co-relation queries the response was YES. [2022-12-13 00:48:21,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 1234 events. 669/1234 cut-off events. For 1522/1620 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 8005 event pairs, 286 based on Foata normal form. 10/608 useless extension candidates. Maximal degree in co-relation 4006. Up to 979 conditions per place. [2022-12-13 00:48:21,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 56 transitions, 374 flow [2022-12-13 00:48:21,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-13 00:48:21,595 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [676] L802-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:48:21,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [643] L780-->L785: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:48:21,637 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [756] L780-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_129 (+ v_~__unbuffered_cnt~0_130 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:48:21,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [755] L780-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:48:21,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [680] L802-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:48:21,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [650] L802-->L805: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:48:21,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->L794: Formula: (and (= (store |v_#memory_int_774| |v_~#y~0.base_383| (store (select |v_#memory_int_774| |v_~#y~0.base_383|) |v_~#y~0.offset_383| 1)) |v_#memory_int_773|) (= v_~x~0_42 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, ~#y~0.offset=|v_~#y~0.offset_383|, #memory_int=|v_#memory_int_774|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_383|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, ~#y~0.offset=|v_~#y~0.offset_383|, #memory_int=|v_#memory_int_773|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_383|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int, ~x~0] and [729] L855-3-->L857-2: Formula: (and (= (store |v_#valid_60| |v_ULTIMATE.start_main_~#t1839~0#1.base_14| 1) |v_#valid_59|) (= (store |v_#length_53| |v_ULTIMATE.start_main_~#t1839~0#1.base_14| 4) |v_#length_52|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t1839~0#1.base_14|) 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t1839~0#1.base_14|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre29#1_15|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1)) (not (= |v_ULTIMATE.start_main_~#t1839~0#1.base_14| 0)) (= |v_ULTIMATE.start_main_~#t1839~0#1.offset_14| 0) (= (store |v_#memory_int_437| |v_ULTIMATE.start_main_~#t1839~0#1.base_14| (store (select |v_#memory_int_437| |v_ULTIMATE.start_main_~#t1839~0#1.base_14|) |v_ULTIMATE.start_main_~#t1839~0#1.offset_14| |v_ULTIMATE.start_main_#t~pre29#1_15|)) |v_#memory_int_436|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_437|, #length=|v_#length_53|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_15|, #pthreadsForks=|v_#pthreadsForks_38|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_436|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_17|, #length=|v_#length_52|, ULTIMATE.start_main_~#t1839~0#1.base=|v_ULTIMATE.start_main_~#t1839~0#1.base_14|, ULTIMATE.start_main_~#t1839~0#1.offset=|v_ULTIMATE.start_main_~#t1839~0#1.offset_14|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, #length, ULTIMATE.start_main_~#t1839~0#1.base, ULTIMATE.start_main_~#t1839~0#1.offset, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 00:48:21,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->L794: Formula: (and (= (store |v_#memory_int_774| |v_~#y~0.base_383| (store (select |v_#memory_int_774| |v_~#y~0.base_383|) |v_~#y~0.offset_383| 1)) |v_#memory_int_773|) (= v_~x~0_42 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, ~#y~0.offset=|v_~#y~0.offset_383|, #memory_int=|v_#memory_int_774|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_383|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, ~#y~0.offset=|v_~#y~0.offset_383|, #memory_int=|v_#memory_int_773|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_383|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int, ~x~0] and [687] $Ultimate##0-->L825: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse4 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse8 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse6 (not .cse16)) (.cse5 (not .cse13)) (.cse12 (select |v_#memory_int_339| |v_~#y~0.base_220|)) (.cse15 (and .cse13 .cse4)) (.cse14 (and .cse7 .cse13))) (let ((.cse2 (or .cse16 .cse15 .cse14)) (.cse0 (select .cse12 |v_~#y~0.offset_220|)) (.cse3 (and .cse6 .cse5)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse1 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (= v_~y$mem_tmp~0_64 .cse0) (= v_~y$w_buff0_used~0_279 (ite .cse1 v_~y$w_buff0_used~0_280 (ite .cse2 v_~y$w_buff0_used~0_280 (ite .cse3 0 v_~y$w_buff0_used~0_280)))) (or (and .cse2 (= |v_P2_#t~mem17_34| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_34| .cse0)) (and (or (not .cse4) .cse5) .cse6 (or .cse5 (not .cse7)) (= (ite .cse3 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32) (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_34|))) (or (and (= |v_P2_#t~ite21_37| |v_P2_#t~mem20_34|) (= |v_P2_#t~mem20_34| v_~__unbuffered_p2_EAX~0_32) .cse8) (and (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_34|) (= |v_P2_#t~ite21_37| v_~y$mem_tmp~0_64) .cse1)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse1 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse7 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse12 |v_~#y~0.offset_220| |v_P2_#t~ite21_37|)) |v_#memory_int_338|) (= v_~y$flush_delayed~0_106 0) (= (ite .cse1 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse5) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse1 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~ite21_37|, |v_P2_#t~mem17_34|, |v_P2_#t~mem20_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-13 00:48:22,442 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:48:22,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1330 [2022-12-13 00:48:22,443 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 400 flow [2022-12-13 00:48:22,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:22,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:22,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:22,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:48:22,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash -176007455, now seen corresponding path program 1 times [2022-12-13 00:48:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:22,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543740807] [2022-12-13 00:48:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:22,606 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 00:48:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:22,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543740807] [2022-12-13 00:48:22,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543740807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:22,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:22,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103854257] [2022-12-13 00:48:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:22,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:22,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-13 00:48:22,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:22,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:22,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-13 00:48:22,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:22,949 INFO L130 PetriNetUnfolder]: 855/1622 cut-off events. [2022-12-13 00:48:22,949 INFO L131 PetriNetUnfolder]: For 4507/4663 co-relation queries the response was YES. [2022-12-13 00:48:22,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7007 conditions, 1622 events. 855/1622 cut-off events. For 4507/4663 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 11271 event pairs, 82 based on Foata normal form. 184/1146 useless extension candidates. Maximal degree in co-relation 6982. Up to 1123 conditions per place. [2022-12-13 00:48:22,961 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 43 selfloop transitions, 32 changer transitions 17/100 dead transitions. [2022-12-13 00:48:22,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 879 flow [2022-12-13 00:48:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:48:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:48:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-13 00:48:22,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-13 00:48:22,963 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 400 flow. Second operand 6 states and 108 transitions. [2022-12-13 00:48:22,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 879 flow [2022-12-13 00:48:22,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 834 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:22,978 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 567 flow [2022-12-13 00:48:22,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2022-12-13 00:48:22,979 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2022-12-13 00:48:22,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:22,979 INFO L89 Accepts]: Start accepts. Operand has 62 places, 68 transitions, 567 flow [2022-12-13 00:48:22,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:22,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:22,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 68 transitions, 567 flow [2022-12-13 00:48:22,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 68 transitions, 567 flow [2022-12-13 00:48:23,058 INFO L130 PetriNetUnfolder]: 384/942 cut-off events. [2022-12-13 00:48:23,058 INFO L131 PetriNetUnfolder]: For 2633/2972 co-relation queries the response was YES. [2022-12-13 00:48:23,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 942 events. 384/942 cut-off events. For 2633/2972 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 7199 event pairs, 90 based on Foata normal form. 5/505 useless extension candidates. Maximal degree in co-relation 4423. Up to 724 conditions per place. [2022-12-13 00:48:23,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 68 transitions, 567 flow [2022-12-13 00:48:23,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-13 00:48:23,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] $Ultimate##0-->L777: Formula: (let ((.cse11 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd1~0_66 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_316 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_73 256) 0))) (let ((.cse14 (= (mod v_~weak$$choice2~0_146 256) 0)) (.cse9 (not .cse8)) (.cse12 (not .cse16)) (.cse13 (select |v_#memory_int_395| |v_~#y~0.base_242|)) (.cse1 (and .cse10 .cse8)) (.cse2 (and .cse11 .cse8))) (let ((.cse5 (or .cse1 .cse16 .cse2)) (.cse4 (select .cse13 |v_~#y~0.offset_242|)) (.cse6 (and .cse9 .cse12)) (.cse0 (not .cse14)) (.cse7 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_315 256) 0))) (and (= |v_~#y~0.base_242| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_54) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~weak$$choice2~0_146 |v_P0Thread1of1ForFork1_#t~nondet4_10|) (= v_~y$mem_tmp~0_80 .cse4) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= (ite .cse0 v_~y$w_buff0_used~0_316 (ite .cse5 v_~y$w_buff0_used~0_316 (ite .cse6 0 v_~y$w_buff0_used~0_316))) v_~y$w_buff0_used~0_315) (= v_~y$r_buff0_thd1~0_72 (ite .cse0 v_~y$r_buff0_thd1~0_73 (ite (or .cse1 (and .cse7 .cse8) .cse3) v_~y$r_buff0_thd1~0_73 (ite (and .cse9 (not .cse3)) 0 v_~y$r_buff0_thd1~0_73)))) (= v_~y$w_buff1~0_179 v_~y$w_buff1~0_178) (or (and (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem6_46|) .cse5 (= .cse4 |v_P0_#t~mem6_46|)) (and (= |v_P0Thread1of1ForFork1_#t~mem6_10| |v_P0_#t~mem6_46|) (or .cse9 (not .cse10)) (= (ite .cse6 v_~y$w_buff0~0_163 v_~y$w_buff1~0_179) v_~__unbuffered_p0_EAX~0_67) (or .cse9 (not .cse11)) .cse12)) (= v_~y$flush_delayed~0_120 0) (= (store |v_#memory_int_395| |v_~#y~0.base_242| (store .cse13 |v_~#y~0.offset_242| |v_P0_#t~ite10_35|)) |v_#memory_int_394|) (or (and (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem9_28|) .cse14 (= |v_P0_#t~ite10_35| |v_P0_#t~mem9_28|)) (and (= |v_P0_#t~ite10_35| v_~y$mem_tmp~0_80) (= |v_P0Thread1of1ForFork1_#t~mem9_10| |v_P0_#t~mem9_28|) .cse0)) (= v_~y$w_buff0~0_163 v_~y$w_buff0~0_162) (= (ite .cse0 v_~y$r_buff1_thd1~0_66 (ite (let ((.cse15 (= (mod v_~y$r_buff0_thd1~0_72 256) 0))) (or (and .cse15 .cse10) (and .cse15 .cse7) .cse3)) v_~y$r_buff1_thd1~0_66 0)) v_~y$r_buff1_thd1~0_65) (= v_~__unbuffered_p0_EAX$read_delayed~0_53 1) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_55) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_54 |v_~#y~0.offset_242|))))) InVars {~#y~0.offset=|v_~#y~0.offset_242|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_316, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_10|, ~#y~0.base=|v_~#y~0.base_242|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_179, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_163, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, #memory_int=|v_#memory_int_395|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_7|, ~#y~0.offset=|v_~#y~0.offset_242|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_315, ~#y~0.base=|v_~#y~0.base_242|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_7|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_65, ~y$mem_tmp~0=v_~y$mem_tmp~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_72, ~y$flush_delayed~0=v_~y$flush_delayed~0_120, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_54, ~weak$$choice0~0=v_~weak$$choice0~0_55, ~y$w_buff1~0=v_~y$w_buff1~0_178, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_7|, #memory_int=|v_#memory_int_394|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_54, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P0_#t~ite10_35|, |v_P0_#t~mem9_28|, |v_P0_#t~mem6_46|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem9, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p0_EAX$read_delayed~0, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [655] L825-->L827: Formula: (= |v_#memory_int_25| (store |v_#memory_int_26| |v_~#y~0.base_19| (store (select |v_#memory_int_26| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2))) InVars {#memory_int=|v_#memory_int_26|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 00:48:23,751 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:48:23,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 773 [2022-12-13 00:48:23,752 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 534 flow [2022-12-13 00:48:23,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:23,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:23,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:23,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:48:23,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1656362678, now seen corresponding path program 1 times [2022-12-13 00:48:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:23,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602537276] [2022-12-13 00:48:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:23,900 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 00:48:23,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:23,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602537276] [2022-12-13 00:48:23,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602537276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:23,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:23,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:23,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539839386] [2022-12-13 00:48:23,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:23,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:23,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:23,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 00:48:23,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 00:48:23,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:23,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 00:48:23,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:24,045 INFO L130 PetriNetUnfolder]: 463/1039 cut-off events. [2022-12-13 00:48:24,046 INFO L131 PetriNetUnfolder]: For 4013/4050 co-relation queries the response was YES. [2022-12-13 00:48:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5256 conditions, 1039 events. 463/1039 cut-off events. For 4013/4050 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6964 event pairs, 70 based on Foata normal form. 100/924 useless extension candidates. Maximal degree in co-relation 5229. Up to 731 conditions per place. [2022-12-13 00:48:24,056 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 50 selfloop transitions, 4 changer transitions 8/76 dead transitions. [2022-12-13 00:48:24,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 744 flow [2022-12-13 00:48:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 00:48:24,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-13 00:48:24,058 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 534 flow. Second operand 4 states and 62 transitions. [2022-12-13 00:48:24,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 744 flow [2022-12-13 00:48:24,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 646 flow, removed 39 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:24,066 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 389 flow [2022-12-13 00:48:24,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2022-12-13 00:48:24,068 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2022-12-13 00:48:24,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:24,068 INFO L89 Accepts]: Start accepts. Operand has 64 places, 55 transitions, 389 flow [2022-12-13 00:48:24,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:24,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:24,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 55 transitions, 389 flow [2022-12-13 00:48:24,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 55 transitions, 389 flow [2022-12-13 00:48:24,117 INFO L130 PetriNetUnfolder]: 132/562 cut-off events. [2022-12-13 00:48:24,118 INFO L131 PetriNetUnfolder]: For 1028/1031 co-relation queries the response was YES. [2022-12-13 00:48:24,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2079 conditions, 562 events. 132/562 cut-off events. For 1028/1031 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4853 event pairs, 54 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 2055. Up to 244 conditions per place. [2022-12-13 00:48:24,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 55 transitions, 389 flow [2022-12-13 00:48:24,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 00:48:24,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L777-->L780: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] and [772] L857-3-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_69| 0) (= |v_P0Thread1of1ForFork1_#res.offset_69| 0) (= v_~__unbuffered_cnt~0_473 (+ v_~__unbuffered_cnt~0_474 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_104 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_474 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_104)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_474} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_101|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_89|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_69|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_69|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_104, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:48:24,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L777-->L780: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] and [770] L857-3-->L785: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_466 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= v_~__unbuffered_cnt~0_465 (+ v_~__unbuffered_cnt~0_466 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (mod v_~main$tmp_guard0~0_100 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_466} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_97|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_465, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~__unbuffered_cnt~0, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:48:24,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L777-->L780: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] and [771] L857-3-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_469 (+ v_~__unbuffered_cnt~0_470 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_470 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111|) (= |v_P0Thread1of1ForFork1_#res.offset_67| 0) (= |v_P0Thread1of1ForFork1_#res.base_67| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_470} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_99|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_87|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_67|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_67|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_469, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:48:24,444 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:48:24,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 377 [2022-12-13 00:48:24,445 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 381 flow [2022-12-13 00:48:24,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 00:48:24,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:24,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:48:24,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash -24423169, now seen corresponding path program 1 times [2022-12-13 00:48:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:24,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826299396] [2022-12-13 00:48:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:24,601 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 00:48:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826299396] [2022-12-13 00:48:24,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826299396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:24,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:24,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:48:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814864776] [2022-12-13 00:48:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:24,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:48:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:48:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:48:24,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-13 00:48:24,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 00:48:24,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:24,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-13 00:48:24,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:24,757 INFO L130 PetriNetUnfolder]: 165/513 cut-off events. [2022-12-13 00:48:24,757 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-13 00:48:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 513 events. 165/513 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3500 event pairs, 3 based on Foata normal form. 99/432 useless extension candidates. Maximal degree in co-relation 2329. Up to 244 conditions per place. [2022-12-13 00:48:24,759 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2022-12-13 00:48:24,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 605 flow [2022-12-13 00:48:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:48:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:48:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 00:48:24,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-13 00:48:24,761 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 381 flow. Second operand 7 states and 75 transitions. [2022-12-13 00:48:24,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 605 flow [2022-12-13 00:48:24,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 543 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 00:48:24,766 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2022-12-13 00:48:24,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2022-12-13 00:48:24,767 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-13 00:48:24,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:24,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 0 transitions, 0 flow [2022-12-13 00:48:24,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:48:24,768 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:48:24,768 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:24,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 00:48:24,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:48:24,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:48:24,769 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:24,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 00:48:24,770 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:48:24,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 00:48:24,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:48:24,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:48:24,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:48:24,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:48:24,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:48:24,776 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:24,780 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:48:24,780 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:48:24,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:48:24 BasicIcfg [2022-12-13 00:48:24,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:48:24,783 INFO L158 Benchmark]: Toolchain (without parser) took 23530.76ms. Allocated memory was 196.1MB in the beginning and 638.6MB in the end (delta: 442.5MB). Free memory was 170.3MB in the beginning and 595.0MB in the end (delta: -424.7MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2022-12-13 00:48:24,783 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:48:24,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.99ms. Allocated memory is still 196.1MB. Free memory was 170.3MB in the beginning and 141.5MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:48:24,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 196.1MB. Free memory was 141.5MB in the beginning and 138.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:24,784 INFO L158 Benchmark]: Boogie Preprocessor took 25.02ms. Allocated memory is still 196.1MB. Free memory was 138.8MB in the beginning and 136.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:24,784 INFO L158 Benchmark]: RCFGBuilder took 865.90ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 136.2MB in the beginning and 203.1MB in the end (delta: -66.9MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-12-13 00:48:24,784 INFO L158 Benchmark]: TraceAbstraction took 22117.53ms. Allocated memory was 235.9MB in the beginning and 638.6MB in the end (delta: 402.7MB). Free memory was 202.1MB in the beginning and 595.0MB in the end (delta: -392.9MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-12-13 00:48:24,785 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.99ms. Allocated memory is still 196.1MB. Free memory was 170.3MB in the beginning and 141.5MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 196.1MB. Free memory was 141.5MB in the beginning and 138.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.02ms. Allocated memory is still 196.1MB. Free memory was 138.8MB in the beginning and 136.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 865.90ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 136.2MB in the beginning and 203.1MB in the end (delta: -66.9MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. * TraceAbstraction took 22117.53ms. Allocated memory was 235.9MB in the beginning and 638.6MB in the end (delta: 402.7MB). Free memory was 202.1MB in the beginning and 595.0MB in the end (delta: -392.9MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 119 PlacesBefore, 39 PlacesAfterwards, 110 TransitionsBefore, 30 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1377, independent: 1284, independent conditional: 1284, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1377, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1377, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1377, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 862, independent: 818, independent conditional: 0, independent unconditional: 818, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 862, independent: 798, independent conditional: 0, independent unconditional: 798, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 340, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 322, dependent conditional: 0, dependent unconditional: 322, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1377, independent: 466, independent conditional: 0, independent unconditional: 466, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 862, unknown conditional: 0, unknown unconditional: 862] , Statistics on independence cache: Total cache size (in pairs): 1588, Positive cache size: 1544, Positive conditional cache size: 0, Positive unconditional cache size: 1544, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 143, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 123, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 123, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 123, unknown conditional: 0, unknown unconditional: 123] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 247, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 247, independent: 213, independent conditional: 56, independent unconditional: 157, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 247, independent: 213, independent conditional: 56, independent unconditional: 157, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 247, independent: 213, independent conditional: 56, independent unconditional: 157, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 34, independent conditional: 29, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 247, independent: 179, independent conditional: 27, independent unconditional: 152, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 35, unknown conditional: 29, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 136, Positive conditional cache size: 29, Positive unconditional cache size: 107, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 56, independent conditional: 4, independent unconditional: 52, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 142, Positive conditional cache size: 29, Positive unconditional cache size: 113, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 46 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 86, independent conditional: 2, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 86, independent conditional: 2, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 86, independent conditional: 2, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 1, independent unconditional: 16, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 69, independent conditional: 1, independent unconditional: 68, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 19, unknown conditional: 1, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 173, Positive conditional cache size: 30, Positive unconditional cache size: 143, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 54, independent conditional: 9, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 54, independent conditional: 9, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 54, independent conditional: 9, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 32, independent conditional: 9, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 33, unknown conditional: 9, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 205, Positive conditional cache size: 39, Positive unconditional cache size: 166, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 93, independent conditional: 93, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 93, independent conditional: 36, independent unconditional: 57, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 93, independent conditional: 21, independent unconditional: 72, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 93, independent conditional: 21, independent unconditional: 72, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 80, independent conditional: 21, independent unconditional: 59, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 218, Positive conditional cache size: 39, Positive unconditional cache size: 179, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 59 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 54 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 658, independent: 626, independent conditional: 626, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 658, independent: 626, independent conditional: 416, independent unconditional: 210, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 658, independent: 626, independent conditional: 342, independent unconditional: 284, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 658, independent: 626, independent conditional: 342, independent unconditional: 284, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 35, independent conditional: 17, independent unconditional: 18, 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: 37, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 658, independent: 591, independent conditional: 325, independent unconditional: 266, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 37, unknown conditional: 17, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 286, Positive conditional cache size: 68, Positive unconditional cache size: 218, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 74, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 62 PlacesBefore, 62 PlacesAfterwards, 68 TransitionsBefore, 64 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 135, independent conditional: 102, independent unconditional: 33, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 135, independent conditional: 96, independent unconditional: 39, dependent: 52, dependent conditional: 1, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 135, independent conditional: 96, independent unconditional: 39, dependent: 52, dependent conditional: 1, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 41, independent conditional: 38, independent unconditional: 3, 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: 42, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 94, independent conditional: 58, independent unconditional: 36, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 42, unknown conditional: 39, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 329, Positive conditional cache size: 107, Positive unconditional cache size: 222, Negative cache size: 32, Negative conditional cache size: 1, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 64 PlacesBefore, 62 PlacesAfterwards, 55 TransitionsBefore, 51 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 590, independent: 568, independent conditional: 568, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 590, independent: 568, independent conditional: 548, independent unconditional: 20, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 590, independent: 568, independent conditional: 518, independent unconditional: 50, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 590, independent: 568, independent conditional: 518, independent unconditional: 50, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 13, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 590, independent: 552, independent conditional: 505, independent unconditional: 47, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 16, unknown conditional: 13, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 561, Positive conditional cache size: 153, Positive unconditional cache size: 408, Negative cache size: 32, Negative conditional cache size: 1, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 561, Positive conditional cache size: 153, Positive unconditional cache size: 408, Negative cache size: 32, Negative conditional cache size: 1, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 4 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: 22.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 841 IncrementalHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 3 mSDtfsCounter, 841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=567occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 1404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 00:48:24,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...