/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/safe007_power.oepc-thin001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:11:55,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:11:55,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:11:55,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:11:55,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:11:55,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:11:55,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:11:55,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:11:55,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:11:55,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:11:55,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:11:55,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:11:55,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:11:55,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:11:55,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:11:55,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:11:55,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:11:55,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:11:55,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:11:55,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:11:55,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:11:55,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:11:55,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:11:55,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:11:55,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:11:55,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:11:55,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:11:55,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:11:55,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:11:55,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:11:55,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:11:55,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:11:55,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:11:55,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:11:55,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:11:55,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:11:55,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:11:55,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:11:55,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:11:55,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:11:55,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:11:55,606 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-05 23:11:55,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:11:55,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:11:55,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:11:55,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:11:55,630 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:11:55,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:11:55,630 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:11:55,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:11:55,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:11:55,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:11:55,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:11:55,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:55,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:11:55,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:11:55,633 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-05 23:11:55,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:11:55,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:11:55,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:11:55,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:11:55,912 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:11:55,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-12-05 23:11:56,951 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:11:57,211 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:11:57,212 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-12-05 23:11:57,225 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873d67f8e/e69c6edf0d1142f58781a7c3fc7a2804/FLAG7d3144816 [2022-12-05 23:11:57,236 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873d67f8e/e69c6edf0d1142f58781a7c3fc7a2804 [2022-12-05 23:11:57,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:11:57,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:11:57,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:57,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:11:57,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:11:57,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e9cd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57, skipping insertion in model container [2022-12-05 23:11:57,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:11:57,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:11:57,409 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-12-05 23:11:57,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:57,607 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:11:57,617 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-12-05 23:11:57,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:57,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:57,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:57,705 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:11:57,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57 WrapperNode [2022-12-05 23:11:57,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:57,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:57,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:11:57,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:11:57,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,762 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-05 23:11:57,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:57,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:11:57,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:11:57,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:11:57,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,796 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:11:57,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:11:57,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:11:57,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:11:57,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (1/1) ... [2022-12-05 23:11:57,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:11:57,849 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-05 23:11:57,861 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-05 23:11:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:11:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:11:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:11:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:11:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:11:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:11:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:11:57,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:11:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:11:57,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:11:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:11:57,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:11:57,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:11:57,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:11:57,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:11:57,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:11:57,887 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:11:58,019 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:11:58,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:11:58,250 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:11:58,447 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:11:58,447 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:11:58,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:58 BoogieIcfgContainer [2022-12-05 23:11:58,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:11:58,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:11:58,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:11:58,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:11:58,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:11:57" (1/3) ... [2022-12-05 23:11:58,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784e8c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:58, skipping insertion in model container [2022-12-05 23:11:58,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:57" (2/3) ... [2022-12-05 23:11:58,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784e8c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:58, skipping insertion in model container [2022-12-05 23:11:58,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:58" (3/3) ... [2022-12-05 23:11:58,456 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2022-12-05 23:11:58,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:11:58,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:11:58,470 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:11:58,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:11:58,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-05 23:11:58,661 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-05 23:11:58,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:58,666 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 48 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-05 23:11:58,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-05 23:11:58,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-05 23:11:58,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:58,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-05 23:11:58,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-05 23:11:58,711 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-05 23:11:58,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:58,712 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 39 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-05 23:11:58,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-05 23:11:58,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-05 23:12:07,068 INFO L203 LiptonReduction]: Total number of compositions: 92 [2022-12-05 23:12:07,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:12:07,094 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;@1da57bbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:12:07,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:12:07,099 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-05 23:12:07,099 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:07,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:07,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:07,101 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-05 23:12:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 799131745, now seen corresponding path program 1 times [2022-12-05 23:12:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:07,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835558962] [2022-12-05 23:12:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:07,319 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-05 23:12:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:07,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835558962] [2022-12-05 23:12:07,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835558962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:07,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:07,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:12:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713486759] [2022-12-05 23:12:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:12:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:12:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:12:07,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-05 23:12:07,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:07,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:07,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-05 23:12:07,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:07,524 INFO L130 PetriNetUnfolder]: 293/488 cut-off events. [2022-12-05 23:12:07,525 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-05 23:12:07,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 488 events. 293/488 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2079 event pairs, 293 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 970. Up to 463 conditions per place. [2022-12-05 23:12:07,533 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 16 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-05 23:12:07,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 79 flow [2022-12-05 23:12:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:12:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:12:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-05 23:12:07,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-05 23:12:07,542 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 23 transitions. [2022-12-05 23:12:07,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 79 flow [2022-12-05 23:12:07,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:12:07,545 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-05 23:12:07,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-05 23:12:07,550 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:12:07,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:07,550 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-05 23:12:07,552 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:07,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:07,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-05 23:12:07,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-05 23:12:07,563 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:12:07,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:12:07,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-05 23:12:07,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-05 23:12:07,685 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:07,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-05 23:12:07,687 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-05 23:12:07,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:07,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:07,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:12:07,688 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-05 23:12:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash -833554059, now seen corresponding path program 1 times [2022-12-05 23:12:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:07,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687349255] [2022-12-05 23:12:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:07,985 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-05 23:12:07,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:07,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687349255] [2022-12-05 23:12:07,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687349255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:07,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:07,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:12:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105319447] [2022-12-05 23:12:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:07,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:12:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:12:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:12:07,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-05 23:12:07,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:07,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:07,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-05 23:12:07,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:08,088 INFO L130 PetriNetUnfolder]: 264/471 cut-off events. [2022-12-05 23:12:08,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:08,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 471 events. 264/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2145 event pairs, 60 based on Foata normal form. 12/479 useless extension candidates. Maximal degree in co-relation 912. Up to 325 conditions per place. [2022-12-05 23:12:08,091 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-05 23:12:08,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 114 flow [2022-12-05 23:12:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:12:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:12:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:12:08,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2022-12-05 23:12:08,092 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 35 transitions. [2022-12-05 23:12:08,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 114 flow [2022-12-05 23:12:08,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:12:08,093 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-05 23:12:08,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-05 23:12:08,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-05 23:12:08,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:08,094 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-05 23:12:08,094 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:08,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:08,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-05 23:12:08,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-05 23:12:08,098 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:12:08,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:08,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:08,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-05 23:12:08,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-05 23:12:08,099 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:08,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-05 23:12:08,100 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-05 23:12:08,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:08,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:08,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:08,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:12:08,101 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-05 23:12:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash -70372069, now seen corresponding path program 1 times [2022-12-05 23:12:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:08,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213370349] [2022-12-05 23:12:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:08,292 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-05 23:12:08,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:08,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213370349] [2022-12-05 23:12:08,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213370349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:08,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:08,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:12:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659446045] [2022-12-05 23:12:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:08,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:12:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:12:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:12:08,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-05 23:12:08,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05 23:12:08,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:08,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-05 23:12:08,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:08,390 INFO L130 PetriNetUnfolder]: 246/447 cut-off events. [2022-12-05 23:12:08,390 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-05 23:12:08,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 447 events. 246/447 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2068 event pairs, 52 based on Foata normal form. 8/451 useless extension candidates. Maximal degree in co-relation 962. Up to 307 conditions per place. [2022-12-05 23:12:08,394 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-05 23:12:08,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 135 flow [2022-12-05 23:12:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:12:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:12:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 23:12:08,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-05 23:12:08,396 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 37 transitions. [2022-12-05 23:12:08,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 135 flow [2022-12-05 23:12:08,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:08,397 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2022-12-05 23:12:08,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-05 23:12:08,398 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-05 23:12:08,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:08,398 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 56 flow [2022-12-05 23:12:08,399 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:08,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:08,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-05 23:12:08,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 56 flow [2022-12-05 23:12:08,405 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:12:08,406 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:12:08,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:08,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-05 23:12:08,406 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-05 23:12:08,408 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:08,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:12:08,409 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2022-12-05 23:12:08,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05 23:12:08,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:08,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:08,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:12:08,409 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-05 23:12:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash -522685653, now seen corresponding path program 1 times [2022-12-05 23:12:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:08,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40488353] [2022-12-05 23:12:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:08,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-05 23:12:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:08,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40488353] [2022-12-05 23:12:08,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40488353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:08,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:08,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:12:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970894789] [2022-12-05 23:12:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:08,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:12:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:12:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:12:08,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 23:12:08,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 23:12:08,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:08,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 23:12:08,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:08,742 INFO L130 PetriNetUnfolder]: 409/702 cut-off events. [2022-12-05 23:12:08,742 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-05 23:12:08,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 702 events. 409/702 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3426 event pairs, 139 based on Foata normal form. 24/718 useless extension candidates. Maximal degree in co-relation 1572. Up to 234 conditions per place. [2022-12-05 23:12:08,745 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 31 selfloop transitions, 3 changer transitions 3/39 dead transitions. [2022-12-05 23:12:08,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 177 flow [2022-12-05 23:12:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 23:12:08,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-05 23:12:08,748 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 4 states and 47 transitions. [2022-12-05 23:12:08,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 177 flow [2022-12-05 23:12:08,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:08,750 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 66 flow [2022-12-05 23:12:08,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-05 23:12:08,753 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-05 23:12:08,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:08,753 INFO L89 Accepts]: Start accepts. Operand has 33 places, 19 transitions, 66 flow [2022-12-05 23:12:08,755 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:08,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:08,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 66 flow [2022-12-05 23:12:08,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 66 flow [2022-12-05 23:12:08,759 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:12:08,759 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-05 23:12:08,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 0/19 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:08,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 66 flow [2022-12-05 23:12:08,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 23:12:09,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:09,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1166 [2022-12-05 23:12:09,922 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 64 flow [2022-12-05 23:12:09,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 23:12:09,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:09,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:12:09,922 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-05 23:12:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 10104490, now seen corresponding path program 1 times [2022-12-05 23:12:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:09,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534797299] [2022-12-05 23:12:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:09,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:10,066 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-05 23:12:10,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534797299] [2022-12-05 23:12:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534797299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:10,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:10,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:12:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19861576] [2022-12-05 23:12:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:10,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:12:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:12:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:12:10,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-05 23:12:10,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-05 23:12:10,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:10,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-05 23:12:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:10,137 INFO L130 PetriNetUnfolder]: 172/314 cut-off events. [2022-12-05 23:12:10,138 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-12-05 23:12:10,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 314 events. 172/314 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1182 event pairs, 46 based on Foata normal form. 4/316 useless extension candidates. Maximal degree in co-relation 799. Up to 210 conditions per place. [2022-12-05 23:12:10,139 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-05 23:12:10,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 129 flow [2022-12-05 23:12:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:12:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:12:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 23:12:10,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-05 23:12:10,143 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 64 flow. Second operand 3 states and 29 transitions. [2022-12-05 23:12:10,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 129 flow [2022-12-05 23:12:10,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 24 transitions, 107 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-05 23:12:10,145 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 56 flow [2022-12-05 23:12:10,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2022-12-05 23:12:10,147 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-05 23:12:10,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:10,147 INFO L89 Accepts]: Start accepts. Operand has 30 places, 18 transitions, 56 flow [2022-12-05 23:12:10,148 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:10,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:10,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-05 23:12:10,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 56 flow [2022-12-05 23:12:10,156 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:12:10,156 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:12:10,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:10,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-05 23:12:10,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-05 23:12:10,205 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:10,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-05 23:12:10,208 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 56 flow [2022-12-05 23:12:10,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-05 23:12:10,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:10,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:10,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:12:10,208 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-05 23:12:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 353270878, now seen corresponding path program 1 times [2022-12-05 23:12:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:10,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545997030] [2022-12-05 23:12:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:10,358 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-05 23:12:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545997030] [2022-12-05 23:12:10,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545997030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:10,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:10,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:12:10,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896357469] [2022-12-05 23:12:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:10,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:12:10,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:12:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:12:10,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:12:10,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:10,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:10,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:12:10,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:10,475 INFO L130 PetriNetUnfolder]: 272/475 cut-off events. [2022-12-05 23:12:10,475 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-05 23:12:10,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 475 events. 272/475 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1911 event pairs, 108 based on Foata normal form. 18/488 useless extension candidates. Maximal degree in co-relation 1070. Up to 177 conditions per place. [2022-12-05 23:12:10,477 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 23 selfloop transitions, 3 changer transitions 5/32 dead transitions. [2022-12-05 23:12:10,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 151 flow [2022-12-05 23:12:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-05 23:12:10,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-05 23:12:10,479 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 56 flow. Second operand 4 states and 37 transitions. [2022-12-05 23:12:10,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 151 flow [2022-12-05 23:12:10,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:10,480 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 66 flow [2022-12-05 23:12:10,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2022-12-05 23:12:10,482 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-05 23:12:10,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:10,482 INFO L89 Accepts]: Start accepts. Operand has 33 places, 18 transitions, 66 flow [2022-12-05 23:12:10,483 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:10,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:10,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 18 transitions, 66 flow [2022-12-05 23:12:10,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 18 transitions, 66 flow [2022-12-05 23:12:10,487 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:12:10,487 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:12:10,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 18 events. 0/18 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:10,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 18 transitions, 66 flow [2022-12-05 23:12:10,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:12:10,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:10,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-05 23:12:10,520 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 64 flow [2022-12-05 23:12:10,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:10,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:10,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:10,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:12:10,521 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-05 23:12:10,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1305538130, now seen corresponding path program 1 times [2022-12-05 23:12:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267819773] [2022-12-05 23:12:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:11,193 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-05 23:12:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:11,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267819773] [2022-12-05 23:12:11,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267819773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:11,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:11,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:12:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468912403] [2022-12-05 23:12:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:11,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:12:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:12:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:12:11,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:12:11,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 64 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:11,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:11,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:12:11,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:11,311 INFO L130 PetriNetUnfolder]: 138/240 cut-off events. [2022-12-05 23:12:11,312 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-05 23:12:11,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 240 events. 138/240 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 711 event pairs, 30 based on Foata normal form. 4/244 useless extension candidates. Maximal degree in co-relation 617. Up to 129 conditions per place. [2022-12-05 23:12:11,313 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-05 23:12:11,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 142 flow [2022-12-05 23:12:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-05 23:12:11,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-05 23:12:11,314 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 64 flow. Second operand 4 states and 28 transitions. [2022-12-05 23:12:11,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 142 flow [2022-12-05 23:12:11,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 126 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-05 23:12:11,316 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 58 flow [2022-12-05 23:12:11,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2022-12-05 23:12:11,316 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-05 23:12:11,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:11,316 INFO L89 Accepts]: Start accepts. Operand has 31 places, 17 transitions, 58 flow [2022-12-05 23:12:11,317 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:11,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:11,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 17 transitions, 58 flow [2022-12-05 23:12:11,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 17 transitions, 58 flow [2022-12-05 23:12:11,322 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:12:11,322 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:12:11,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:11,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 17 transitions, 58 flow [2022-12-05 23:12:11,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-05 23:12:11,374 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:11,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:12:11,375 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 56 flow [2022-12-05 23:12:11,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:11,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:11,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:11,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:12:11,376 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-05 23:12:11,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1093181041, now seen corresponding path program 1 times [2022-12-05 23:12:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:11,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787618243] [2022-12-05 23:12:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:11,537 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-05 23:12:11,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:11,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787618243] [2022-12-05 23:12:11,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787618243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:11,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:11,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:12:11,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338340757] [2022-12-05 23:12:11,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:11,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:12:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:12:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:12:11,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:12:11,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 16 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:11,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:11,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:12:11,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:11,598 INFO L130 PetriNetUnfolder]: 106/203 cut-off events. [2022-12-05 23:12:11,598 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-05 23:12:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 203 events. 106/203 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 685 event pairs, 12 based on Foata normal form. 19/222 useless extension candidates. Maximal degree in co-relation 506. Up to 93 conditions per place. [2022-12-05 23:12:11,599 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 27 selfloop transitions, 5 changer transitions 1/33 dead transitions. [2022-12-05 23:12:11,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 174 flow [2022-12-05 23:12:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-05 23:12:11,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-05 23:12:11,600 INFO L175 Difference]: Start difference. First operand has 30 places, 16 transitions, 56 flow. Second operand 4 states and 35 transitions. [2022-12-05 23:12:11,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 174 flow [2022-12-05 23:12:11,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 158 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-05 23:12:11,601 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 80 flow [2022-12-05 23:12:11,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-05 23:12:11,601 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-05 23:12:11,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:11,601 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 80 flow [2022-12-05 23:12:11,602 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:11,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:11,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 80 flow [2022-12-05 23:12:11,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 80 flow [2022-12-05 23:12:11,608 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2022-12-05 23:12:11,608 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-05 23:12:11,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 47 events. 14/47 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 6 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 102. Up to 29 conditions per place. [2022-12-05 23:12:11,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 80 flow [2022-12-05 23:12:11,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-05 23:12:12,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:12,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1077 [2022-12-05 23:12:12,678 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 81 flow [2022-12-05 23:12:12,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:12,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:12,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:12,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:12:12,679 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-05 23:12:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1708826442, now seen corresponding path program 1 times [2022-12-05 23:12:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:12,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076427523] [2022-12-05 23:12:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:12,831 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-05 23:12:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:12,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076427523] [2022-12-05 23:12:12,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076427523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:12,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:12,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:12:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519014576] [2022-12-05 23:12:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:12,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:12:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:12:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:12:12,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:12:12,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:12,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:12,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:12:12,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:12,902 INFO L130 PetriNetUnfolder]: 57/128 cut-off events. [2022-12-05 23:12:12,902 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-05 23:12:12,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 128 events. 57/128 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 381 event pairs, 11 based on Foata normal form. 14/142 useless extension candidates. Maximal degree in co-relation 404. Up to 57 conditions per place. [2022-12-05 23:12:12,903 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 30 selfloop transitions, 8 changer transitions 1/39 dead transitions. [2022-12-05 23:12:12,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 228 flow [2022-12-05 23:12:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:12:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:12:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-05 23:12:12,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-05 23:12:12,903 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 81 flow. Second operand 5 states and 41 transitions. [2022-12-05 23:12:12,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 228 flow [2022-12-05 23:12:12,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 218 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:12,904 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 121 flow [2022-12-05 23:12:12,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 23:12:12,905 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-05 23:12:12,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:12,905 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 121 flow [2022-12-05 23:12:12,905 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:12,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:12,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 121 flow [2022-12-05 23:12:12,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 121 flow [2022-12-05 23:12:12,912 INFO L130 PetriNetUnfolder]: 8/39 cut-off events. [2022-12-05 23:12:12,912 INFO L131 PetriNetUnfolder]: For 29/33 co-relation queries the response was YES. [2022-12-05 23:12:12,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 39 events. 8/39 cut-off events. For 29/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 108. Up to 20 conditions per place. [2022-12-05 23:12:12,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 121 flow [2022-12-05 23:12:12,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:12:12,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:12,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-05 23:12:12,943 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 123 flow [2022-12-05 23:12:12,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:12,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:12,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:12,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:12:12,943 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-05 23:12:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1958510294, now seen corresponding path program 1 times [2022-12-05 23:12:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:12,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343383085] [2022-12-05 23:12:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:13,122 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-05 23:12:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343383085] [2022-12-05 23:12:13,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343383085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:13,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:13,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:12:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109483035] [2022-12-05 23:12:13,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:12:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:12:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:12:13,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:12:13,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:13,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:13,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:12:13,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:13,193 INFO L130 PetriNetUnfolder]: 31/80 cut-off events. [2022-12-05 23:12:13,193 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-05 23:12:13,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 80 events. 31/80 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 198 event pairs, 6 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 297. Up to 31 conditions per place. [2022-12-05 23:12:13,194 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 22 selfloop transitions, 11 changer transitions 1/34 dead transitions. [2022-12-05 23:12:13,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 231 flow [2022-12-05 23:12:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:12:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:12:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-05 23:12:13,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 23:12:13,195 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 123 flow. Second operand 6 states and 36 transitions. [2022-12-05 23:12:13,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 231 flow [2022-12-05 23:12:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 204 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-05 23:12:13,196 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 137 flow [2022-12-05 23:12:13,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2022-12-05 23:12:13,196 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-05 23:12:13,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:13,197 INFO L89 Accepts]: Start accepts. Operand has 38 places, 22 transitions, 137 flow [2022-12-05 23:12:13,197 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:13,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:13,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 137 flow [2022-12-05 23:12:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 22 transitions, 137 flow [2022-12-05 23:12:13,202 INFO L130 PetriNetUnfolder]: 5/30 cut-off events. [2022-12-05 23:12:13,203 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-12-05 23:12:13,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 30 events. 5/30 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 82. Up to 11 conditions per place. [2022-12-05 23:12:13,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 22 transitions, 137 flow [2022-12-05 23:12:13,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-05 23:12:13,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L798-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [618] L842-3-->L845: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_43) 1 0) 0) 0 1) v_~main$tmp_guard0~0_26) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-05 23:12:15,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] L783-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [665] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~z$r_buff0_thd0~0_140 256) 0))) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_358 256) 0)) (.cse12 (= 0 (mod v_~z$r_buff1_thd0~0_134 256))) (.cse11 (= (mod v_~z$w_buff1_used~0_348 256) 0)) (.cse4 (not .cse14)) (.cse6 (not (= (mod v_~z$w_buff0_used~0_357 256) 0)))) (let ((.cse8 (and .cse4 .cse6)) (.cse9 (not .cse11)) (.cse7 (not .cse12)) (.cse3 (select |v_#memory_int_472| |v_~#z~0.base_231|)) (.cse5 (not .cse13))) (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_81 1) (= v_~__unbuffered_p2_EAX~0_85 1) (= v_~__unbuffered_p0_EAX~0_163 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~mem32#1_159| |v_ULTIMATE.start_main_#t~mem32#1_161|)) (.cse2 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_105 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_158| v_~__unbuffered_p0_EAX~0_163) (let ((.cse0 (= (mod v_~weak$$choice1~0_150 256) 0))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~ite33#1_158| |v_ULTIMATE.start_main_#t~mem32#1_159|) (= (select (select |v_#memory_int_471| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114) |v_ULTIMATE.start_main_#t~mem32#1_159|)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite33#1_158| v_~__unbuffered_p0_EAX~0_164) .cse1))) (not .cse2)) (and (= v_~__unbuffered_p0_EAX~0_164 v_~__unbuffered_p0_EAX~0_163) .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite33#1_158| |v_ULTIMATE.start_main_#t~ite33#1_160|)))) (= (store |v_#memory_int_472| |v_~#z~0.base_231| (store .cse3 |v_~#z~0.offset_231| |v_ULTIMATE.start_main_#t~ite30#1_142|)) |v_#memory_int_471|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= v_~z$w_buff0_used~0_357 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_358)) (= v_~z$r_buff1_thd0~0_133 (ite (or (and (not (= 0 (mod v_~z$r_buff0_thd0~0_139 256))) .cse6) (and (not (= (mod v_~z$w_buff1_used~0_347 256) 0)) .cse7)) 0 v_~z$r_buff1_thd0~0_134)) (= (ite (or .cse8 (and .cse9 .cse7)) 0 v_~z$w_buff1_used~0_348) v_~z$w_buff1_used~0_347) (= v_~z$r_buff0_thd0~0_139 (ite .cse8 0 v_~z$r_buff0_thd0~0_140)) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_199 3) 1 0) 0) 0 1)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem28#1_178| |v_ULTIMATE.start_main_#t~mem28#1_176|))) (or (and (or (and .cse9 .cse7 .cse10 (= |v_ULTIMATE.start_main_#t~ite29#1_177| v_~z$w_buff1~0_220)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_177| |v_ULTIMATE.start_main_#t~mem28#1_176|) (= (select .cse3 |v_~#z~0.offset_231|) |v_ULTIMATE.start_main_#t~mem28#1_176|) (or .cse11 .cse12))) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite29#1_177| |v_ULTIMATE.start_main_#t~ite30#1_142|)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_179| |v_ULTIMATE.start_main_#t~ite29#1_177|) .cse4 (= v_~z$w_buff0~0_212 |v_ULTIMATE.start_main_#t~ite30#1_142|) .cse10 .cse5))) (= v_~weak$$choice1~0_150 |v_ULTIMATE.start_main_#t~nondet31#1_93|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_161|, ~#z~0.base=|v_~#z~0.base_231|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_358, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_348, ~z$w_buff1~0=v_~z$w_buff1~0_220, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_93|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_179|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_164, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_140, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_134, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_160|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, #memory_int=|v_#memory_int_472|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_178|} OutVars{~#z~0.base=|v_~#z~0.base_231|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_65|, ~z$w_buff1~0=v_~z$w_buff1~0_220, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_163, ~weak$$choice1~0=v_~weak$$choice1~0_150, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_76|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_357, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_347, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_59|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_141|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, #memory_int=|v_#memory_int_471|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_177|, |v_ULTIMATE.start_main_#t~ite30#1_142|, |v_ULTIMATE.start_main_#t~mem28#1_176|, |v_ULTIMATE.start_main_#t~ite33#1_158|, |v_ULTIMATE.start_main_#t~mem32#1_159|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:12:16,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L798-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [665] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~z$r_buff0_thd0~0_140 256) 0))) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_358 256) 0)) (.cse12 (= 0 (mod v_~z$r_buff1_thd0~0_134 256))) (.cse11 (= (mod v_~z$w_buff1_used~0_348 256) 0)) (.cse4 (not .cse14)) (.cse6 (not (= (mod v_~z$w_buff0_used~0_357 256) 0)))) (let ((.cse8 (and .cse4 .cse6)) (.cse9 (not .cse11)) (.cse7 (not .cse12)) (.cse3 (select |v_#memory_int_472| |v_~#z~0.base_231|)) (.cse5 (not .cse13))) (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_81 1) (= v_~__unbuffered_p2_EAX~0_85 1) (= v_~__unbuffered_p0_EAX~0_163 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~mem32#1_159| |v_ULTIMATE.start_main_#t~mem32#1_161|)) (.cse2 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_105 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_158| v_~__unbuffered_p0_EAX~0_163) (let ((.cse0 (= (mod v_~weak$$choice1~0_150 256) 0))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~ite33#1_158| |v_ULTIMATE.start_main_#t~mem32#1_159|) (= (select (select |v_#memory_int_471| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114) |v_ULTIMATE.start_main_#t~mem32#1_159|)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite33#1_158| v_~__unbuffered_p0_EAX~0_164) .cse1))) (not .cse2)) (and (= v_~__unbuffered_p0_EAX~0_164 v_~__unbuffered_p0_EAX~0_163) .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite33#1_158| |v_ULTIMATE.start_main_#t~ite33#1_160|)))) (= (store |v_#memory_int_472| |v_~#z~0.base_231| (store .cse3 |v_~#z~0.offset_231| |v_ULTIMATE.start_main_#t~ite30#1_142|)) |v_#memory_int_471|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= v_~z$w_buff0_used~0_357 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_358)) (= v_~z$r_buff1_thd0~0_133 (ite (or (and (not (= 0 (mod v_~z$r_buff0_thd0~0_139 256))) .cse6) (and (not (= (mod v_~z$w_buff1_used~0_347 256) 0)) .cse7)) 0 v_~z$r_buff1_thd0~0_134)) (= (ite (or .cse8 (and .cse9 .cse7)) 0 v_~z$w_buff1_used~0_348) v_~z$w_buff1_used~0_347) (= v_~z$r_buff0_thd0~0_139 (ite .cse8 0 v_~z$r_buff0_thd0~0_140)) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_199 3) 1 0) 0) 0 1)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem28#1_178| |v_ULTIMATE.start_main_#t~mem28#1_176|))) (or (and (or (and .cse9 .cse7 .cse10 (= |v_ULTIMATE.start_main_#t~ite29#1_177| v_~z$w_buff1~0_220)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_177| |v_ULTIMATE.start_main_#t~mem28#1_176|) (= (select .cse3 |v_~#z~0.offset_231|) |v_ULTIMATE.start_main_#t~mem28#1_176|) (or .cse11 .cse12))) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite29#1_177| |v_ULTIMATE.start_main_#t~ite30#1_142|)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_179| |v_ULTIMATE.start_main_#t~ite29#1_177|) .cse4 (= v_~z$w_buff0~0_212 |v_ULTIMATE.start_main_#t~ite30#1_142|) .cse10 .cse5))) (= v_~weak$$choice1~0_150 |v_ULTIMATE.start_main_#t~nondet31#1_93|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_161|, ~#z~0.base=|v_~#z~0.base_231|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_358, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_348, ~z$w_buff1~0=v_~z$w_buff1~0_220, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_93|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_179|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_164, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_140, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_134, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_160|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, #memory_int=|v_#memory_int_472|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_178|} OutVars{~#z~0.base=|v_~#z~0.base_231|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_65|, ~z$w_buff1~0=v_~z$w_buff1~0_220, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_163, ~weak$$choice1~0=v_~weak$$choice1~0_150, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_76|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_357, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_347, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_59|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_141|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, #memory_int=|v_#memory_int_471|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_177|, |v_ULTIMATE.start_main_#t~ite30#1_142|, |v_ULTIMATE.start_main_#t~mem28#1_176|, |v_ULTIMATE.start_main_#t~ite33#1_158|, |v_ULTIMATE.start_main_#t~mem32#1_159|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:12:17,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L812-->P2EXIT: Formula: (let ((.cse5 (= (mod v_~z$r_buff0_thd3~0_104 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not (= (mod v_~z$w_buff0_used~0_345 256) 0))) (.cse9 (= (mod v_~z$r_buff1_thd3~0_100 256) 0)) (.cse8 (= (mod v_~z$w_buff1_used~0_336 256) 0)) (.cse6 (= 0 (mod v_~z$w_buff0_used~0_346 256)))) (let ((.cse3 (not .cse6)) (.cse7 (not .cse8)) (.cse1 (not .cse9)) (.cse10 (select |v_#memory_int_460| |v_~#z~0.base_225|)) (.cse11 (and .cse2 .cse0))) (and (= |v_P2Thread1of1ForFork0_#res.offset_29| 0) (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd3~0_103 256) 0))) (and (not (= 0 (mod v_~z$w_buff1_used~0_335 256))) .cse1)) 0 v_~z$r_buff1_thd3~0_100) v_~z$r_buff1_thd3~0_99) (= v_~z$w_buff0_used~0_345 (ite (and .cse2 .cse3) 0 v_~z$w_buff0_used~0_346)) (let ((.cse4 (= |v_P2Thread1of1ForFork0_#t~mem19_54| |v_P2_#t~mem19_60|))) (or (and (= |v_P2_#t~ite20_55| |v_P2Thread1of1ForFork0_#t~ite20_54|) (= |v_P2_#t~ite21_51| v_~z$w_buff0~0_206) .cse2 .cse3 .cse4) (and (or .cse5 .cse6) (= |v_P2_#t~ite20_55| |v_P2_#t~ite21_51|) (or (and .cse7 (= |v_P2_#t~ite20_55| v_~z$w_buff1~0_214) .cse1 .cse4) (and (= |v_P2_#t~ite20_55| |v_P2_#t~mem19_60|) (or .cse8 .cse9) (= (select .cse10 |v_~#z~0.offset_225|) |v_P2_#t~mem19_60|)))))) (= v_~z$w_buff1_used~0_335 (ite (or .cse11 (and .cse7 .cse1)) 0 v_~z$w_buff1_used~0_336)) (= (store |v_#memory_int_460| |v_~#z~0.base_225| (store .cse10 |v_~#z~0.offset_225| |v_P2_#t~ite21_51|)) |v_#memory_int_459|) (= (ite .cse11 0 v_~z$r_buff0_thd3~0_104) v_~z$r_buff0_thd3~0_103) (= v_~__unbuffered_cnt~0_191 (+ v_~__unbuffered_cnt~0_192 1)) (= |v_P2Thread1of1ForFork0_#res.base_29| 0))))) InVars {~#z~0.base=|v_~#z~0.base_225|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_54|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_346, ~z$w_buff0~0=v_~z$w_buff0~0_206, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_100, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_336, #memory_int=|v_#memory_int_460|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_214, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_192, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_54|, ~#z~0.offset=|v_~#z~0.offset_225|} OutVars{~#z~0.base=|v_~#z~0.base_225|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_345, ~z$w_buff0~0=v_~z$w_buff0~0_206, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_99, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_335, ~z$w_buff1~0=v_~z$w_buff1~0_214, ~#z~0.offset=|v_~#z~0.offset_225|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_29|, #memory_int=|v_#memory_int_459|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_103, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_29|} AuxVars[|v_P2_#t~ite21_51|, |v_P2_#t~mem19_60|, |v_P2_#t~ite20_55|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite21, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] and [665] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~z$r_buff0_thd0~0_140 256) 0))) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_358 256) 0)) (.cse12 (= 0 (mod v_~z$r_buff1_thd0~0_134 256))) (.cse11 (= (mod v_~z$w_buff1_used~0_348 256) 0)) (.cse4 (not .cse14)) (.cse6 (not (= (mod v_~z$w_buff0_used~0_357 256) 0)))) (let ((.cse8 (and .cse4 .cse6)) (.cse9 (not .cse11)) (.cse7 (not .cse12)) (.cse3 (select |v_#memory_int_472| |v_~#z~0.base_231|)) (.cse5 (not .cse13))) (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_81 1) (= v_~__unbuffered_p2_EAX~0_85 1) (= v_~__unbuffered_p0_EAX~0_163 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~mem32#1_159| |v_ULTIMATE.start_main_#t~mem32#1_161|)) (.cse2 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_105 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_158| v_~__unbuffered_p0_EAX~0_163) (let ((.cse0 (= (mod v_~weak$$choice1~0_150 256) 0))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~ite33#1_158| |v_ULTIMATE.start_main_#t~mem32#1_159|) (= (select (select |v_#memory_int_471| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114) |v_ULTIMATE.start_main_#t~mem32#1_159|)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite33#1_158| v_~__unbuffered_p0_EAX~0_164) .cse1))) (not .cse2)) (and (= v_~__unbuffered_p0_EAX~0_164 v_~__unbuffered_p0_EAX~0_163) .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite33#1_158| |v_ULTIMATE.start_main_#t~ite33#1_160|)))) (= (store |v_#memory_int_472| |v_~#z~0.base_231| (store .cse3 |v_~#z~0.offset_231| |v_ULTIMATE.start_main_#t~ite30#1_142|)) |v_#memory_int_471|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= v_~z$w_buff0_used~0_357 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_358)) (= v_~z$r_buff1_thd0~0_133 (ite (or (and (not (= 0 (mod v_~z$r_buff0_thd0~0_139 256))) .cse6) (and (not (= (mod v_~z$w_buff1_used~0_347 256) 0)) .cse7)) 0 v_~z$r_buff1_thd0~0_134)) (= (ite (or .cse8 (and .cse9 .cse7)) 0 v_~z$w_buff1_used~0_348) v_~z$w_buff1_used~0_347) (= v_~z$r_buff0_thd0~0_139 (ite .cse8 0 v_~z$r_buff0_thd0~0_140)) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_199 3) 1 0) 0) 0 1)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem28#1_178| |v_ULTIMATE.start_main_#t~mem28#1_176|))) (or (and (or (and .cse9 .cse7 .cse10 (= |v_ULTIMATE.start_main_#t~ite29#1_177| v_~z$w_buff1~0_220)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_177| |v_ULTIMATE.start_main_#t~mem28#1_176|) (= (select .cse3 |v_~#z~0.offset_231|) |v_ULTIMATE.start_main_#t~mem28#1_176|) (or .cse11 .cse12))) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite29#1_177| |v_ULTIMATE.start_main_#t~ite30#1_142|)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_179| |v_ULTIMATE.start_main_#t~ite29#1_177|) .cse4 (= v_~z$w_buff0~0_212 |v_ULTIMATE.start_main_#t~ite30#1_142|) .cse10 .cse5))) (= v_~weak$$choice1~0_150 |v_ULTIMATE.start_main_#t~nondet31#1_93|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_161|, ~#z~0.base=|v_~#z~0.base_231|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_358, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_348, ~z$w_buff1~0=v_~z$w_buff1~0_220, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_93|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_179|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_164, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_140, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_134, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_160|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, #memory_int=|v_#memory_int_472|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_178|} OutVars{~#z~0.base=|v_~#z~0.base_231|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_65|, ~z$w_buff1~0=v_~z$w_buff1~0_220, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_163, ~weak$$choice1~0=v_~weak$$choice1~0_150, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_76|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_357, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_347, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_59|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_141|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, #memory_int=|v_#memory_int_471|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_177|, |v_ULTIMATE.start_main_#t~ite30#1_142|, |v_ULTIMATE.start_main_#t~mem28#1_176|, |v_ULTIMATE.start_main_#t~ite33#1_158|, |v_ULTIMATE.start_main_#t~mem32#1_159|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:12:21,205 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:12:21,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8009 [2022-12-05 23:12:21,206 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 16 transitions, 121 flow [2022-12-05 23:12:21,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:21,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:21,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:21,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:12:21,206 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-05 23:12:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1847127193, now seen corresponding path program 1 times [2022-12-05 23:12:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:21,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602655303] [2022-12-05 23:12:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:12:21,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:12:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:12:21,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:12:21,283 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:12:21,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 23:12:21,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 23:12:21,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-05 23:12:21,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 23:12:21,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:12:21,285 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:21,289 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:12:21,289 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:12:21,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:12:21 BasicIcfg [2022-12-05 23:12:21,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:12:21,324 INFO L158 Benchmark]: Toolchain (without parser) took 24085.20ms. Allocated memory was 183.5MB in the beginning and 731.9MB in the end (delta: 548.4MB). Free memory was 157.6MB in the beginning and 561.3MB in the end (delta: -403.7MB). Peak memory consumption was 145.2MB. Max. memory is 8.0GB. [2022-12-05 23:12:21,324 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:12:21,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.18ms. Allocated memory is still 183.5MB. Free memory was 157.1MB in the beginning and 130.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:12:21,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.21ms. Allocated memory is still 183.5MB. Free memory was 130.9MB in the beginning and 128.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:12:21,324 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 183.5MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:12:21,324 INFO L158 Benchmark]: RCFGBuilder took 650.56ms. Allocated memory is still 183.5MB. Free memory was 126.2MB in the beginning and 65.9MB in the end (delta: 60.3MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. [2022-12-05 23:12:21,324 INFO L158 Benchmark]: TraceAbstraction took 22870.86ms. Allocated memory was 183.5MB in the beginning and 731.9MB in the end (delta: 548.4MB). Free memory was 65.3MB in the beginning and 561.3MB in the end (delta: -496.0MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2022-12-05 23:12:21,325 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.10ms. Allocated memory is still 183.5MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.18ms. Allocated memory is still 183.5MB. Free memory was 157.1MB in the beginning and 130.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.21ms. Allocated memory is still 183.5MB. Free memory was 130.9MB in the beginning and 128.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 183.5MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 650.56ms. Allocated memory is still 183.5MB. Free memory was 126.2MB in the beginning and 65.9MB in the end (delta: 60.3MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. * TraceAbstraction took 22870.86ms. Allocated memory was 183.5MB in the beginning and 731.9MB in the end (delta: 548.4MB). Free memory was 65.3MB in the beginning and 561.3MB in the end (delta: -496.0MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 119 PlacesBefore, 29 PlacesAfterwards, 110 TransitionsBefore, 20 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 942, independent: 881, independent conditional: 881, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 942, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 942, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 942, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 697, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 697, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 201, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 942, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 697, unknown conditional: 0, unknown unconditional: 697] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 987, Positive conditional cache size: 0, Positive unconditional cache size: 987, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 2, independent unconditional: 44, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 62, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 46, 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: 61, independent: 46, independent conditional: 4, independent unconditional: 42, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 61, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 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: 61, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 33 PlacesBefore, 32 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 77, independent conditional: 16, independent unconditional: 61, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 31, independent conditional: 2, independent unconditional: 29, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 32 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 11, independent unconditional: 34, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 65, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 35, independent conditional: 11, independent unconditional: 24, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 29, dependent conditional: 19, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 26, independent conditional: 1, independent unconditional: 25, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 13, unknown conditional: 3, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 83, Positive conditional cache size: 1, Positive unconditional cache size: 82, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 31 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 90, Positive conditional cache size: 2, Positive unconditional cache size: 88, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 93, Positive conditional cache size: 2, Positive unconditional cache size: 91, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 38 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 16 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 119, Positive conditional cache size: 6, Positive unconditional cache size: 113, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=0, t1937={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1938; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t1938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=1, t1937={7:0}, t1938={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1939; [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=2, t1937={7:0}, t1938={5:0}, t1939={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_p1_EAX = x [L797] 2 y = 1 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L809] 3 __unbuffered_p2_EAX = y [L812] 3 z = 1 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 3 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 3 !(!cond) [L846] RET 3 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 \read(z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 3 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 3 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 3 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L855] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 3 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 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.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 2 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:12:21,346 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...