/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:22:55,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:22:55,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:22:55,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:22:55,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:22:55,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:22:55,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:22:55,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:22:55,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:22:55,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:22:55,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:22:55,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:22:55,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:22:55,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:22:55,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:22:55,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:22:55,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:22:55,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:22:55,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:22:55,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:22:55,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:22:55,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:22:55,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:22:55,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:22:55,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:22:55,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:22:55,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:22:55,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:22:55,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:22:55,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:22:55,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:22:55,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:22:55,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:22:55,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:22:55,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:22:55,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:22:55,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:22:55,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:22:55,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:22:55,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:22:55,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:22:55,537 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:22:55,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:22:55,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:22:55,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:22:55,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:22:55,571 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:22:55,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:22:55,572 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:22:55,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:22:55,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:22:55,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:22:55,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:22:55,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:22:55,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:22:55,574 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:22:55,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:22:55,574 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:22:55,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:22:55,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:22:55,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:22:55,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:22:55,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:22:55,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:22:55,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:22:55,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:22:55,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:22:55,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:22:55,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:22:55,576 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:22:55,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:22:55,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:22:55,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:22:55,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:22:55,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:22:55,926 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:22:55,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2022-12-06 04:22:56,990 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:22:57,280 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:22:57,281 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2022-12-06 04:22:57,306 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129d90491/92672a905ae74d69b2da2987bc01031a/FLAGc06cc59f3 [2022-12-06 04:22:57,319 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129d90491/92672a905ae74d69b2da2987bc01031a [2022-12-06 04:22:57,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:22:57,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:22:57,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:22:57,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:22:57,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:22:57,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d251daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57, skipping insertion in model container [2022-12-06 04:22:57,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:22:57,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:22:57,553 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/rfi006_rmo.i[987,1000] [2022-12-06 04:22:57,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:22:57,781 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:22:57,793 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/rfi006_rmo.i[987,1000] [2022-12-06 04:22:57,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:57,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:57,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:22:57,881 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:22:57,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57 WrapperNode [2022-12-06 04:22:57,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:22:57,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:22:57,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:22:57,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:22:57,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,934 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 04:22:57,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:22:57,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:22:57,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:22:57,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:22:57,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,978 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:22:57,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:22:57,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:22:57,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:22:57,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (1/1) ... [2022-12-06 04:22:57,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:22:58,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:22:58,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:22:58,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:22:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:22:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:22:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:22:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:22:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:22:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:22:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:22:58,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:22:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:22:58,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:22:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:22:58,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:22:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:22:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:22:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:22:58,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:22:58,083 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:22:58,278 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:22:58,280 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:22:58,692 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:22:58,935 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:22:58,936 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:22:58,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:22:58 BoogieIcfgContainer [2022-12-06 04:22:58,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:22:58,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:22:58,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:22:58,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:22:58,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:22:57" (1/3) ... [2022-12-06 04:22:58,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2328822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:22:58, skipping insertion in model container [2022-12-06 04:22:58,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:57" (2/3) ... [2022-12-06 04:22:58,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2328822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:22:58, skipping insertion in model container [2022-12-06 04:22:58,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:22:58" (3/3) ... [2022-12-06 04:22:58,949 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2022-12-06 04:22:58,965 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:22:58,966 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:22:58,966 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:22:59,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:22:59,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:22:59,128 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:22:59,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:59,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 04:22:59,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:22:59,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 04:22:59,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:59,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:22:59,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 04:22:59,212 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 04:22:59,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:59,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:22:59,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:22:59,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 04:23:06,746 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 04:23:06,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:23:06,773 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;@7d1216b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:23:06,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:23:06,778 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:23:06,778 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:06,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:06,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:06,780 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-06 04:23:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash -758409905, now seen corresponding path program 1 times [2022-12-06 04:23:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:06,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190861585] [2022-12-06 04:23:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:07,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190861585] [2022-12-06 04:23:07,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190861585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:07,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:07,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:07,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842887859] [2022-12-06 04:23:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:23:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:07,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:23:07,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:23:07,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:23:07,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:07,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:07,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:23:07,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:07,213 INFO L130 PetriNetUnfolder]: 407/637 cut-off events. [2022-12-06 04:23:07,213 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:23:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 637 events. 407/637 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2567 event pairs, 407 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 1293. Up to 631 conditions per place. [2022-12-06 04:23:07,220 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 04:23:07,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 81 flow [2022-12-06 04:23:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:23:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:23:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2022-12-06 04:23:07,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:23:07,232 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 22 transitions. [2022-12-06 04:23:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 81 flow [2022-12-06 04:23:07,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:23:07,239 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 04:23:07,241 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-06 04:23:07,245 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 04:23:07,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:07,246 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 04:23:07,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:07,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:07,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 04:23:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 04:23:07,263 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:23:07,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:07,263 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 24 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-06 04:23:07,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 04:23:07,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 04:23:07,416 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:07,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 04:23:07,418 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 04:23:07,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:07,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:07,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:07,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:23:07,419 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-06 04:23:07,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1312521108, now seen corresponding path program 1 times [2022-12-06 04:23:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:07,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711497851] [2022-12-06 04:23:07,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:07,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711497851] [2022-12-06 04:23:07,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711497851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:07,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:07,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557254043] [2022-12-06 04:23:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:07,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:23:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:07,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:23:07,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:23:07,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:23:07,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:07,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:07,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:23:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:08,021 INFO L130 PetriNetUnfolder]: 703/1064 cut-off events. [2022-12-06 04:23:08,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:08,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 1064 events. 703/1064 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4317 event pairs, 159 based on Foata normal form. 8/1072 useless extension candidates. Maximal degree in co-relation 2172. Up to 1005 conditions per place. [2022-12-06 04:23:08,029 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 04:23:08,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 134 flow [2022-12-06 04:23:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:23:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:23:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:23:08,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:23:08,031 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:23:08,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 134 flow [2022-12-06 04:23:08,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:23:08,033 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2022-12-06 04:23:08,033 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 04:23:08,034 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 04:23:08,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:08,034 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 63 flow [2022-12-06 04:23:08,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:08,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:08,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 63 flow [2022-12-06 04:23:08,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 63 flow [2022-12-06 04:23:08,042 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:23:08,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:08,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 44. Up to 10 conditions per place. [2022-12-06 04:23:08,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 63 flow [2022-12-06 04:23:08,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 04:23:08,130 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:08,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 04:23:08,132 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2022-12-06 04:23:08,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:08,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:08,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:23:08,132 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-06 04:23:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2033446968, now seen corresponding path program 1 times [2022-12-06 04:23:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101734054] [2022-12-06 04:23:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:08,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-06 04:23:08,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:08,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101734054] [2022-12-06 04:23:08,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101734054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:08,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:08,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479704818] [2022-12-06 04:23:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:23:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:23:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:23:08,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:23:08,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-06 04:23:08,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:08,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:23:08,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:08,535 INFO L130 PetriNetUnfolder]: 570/892 cut-off events. [2022-12-06 04:23:08,536 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-12-06 04:23:08,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 892 events. 570/892 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3639 event pairs, 184 based on Foata normal form. 24/915 useless extension candidates. Maximal degree in co-relation 1957. Up to 621 conditions per place. [2022-12-06 04:23:08,544 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:23:08,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 139 flow [2022-12-06 04:23:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:23:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:23:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:23:08,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-06 04:23:08,545 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:23:08,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 139 flow [2022-12-06 04:23:08,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:08,547 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2022-12-06 04:23:08,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:23:08,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-06 04:23:08,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:08,548 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 68 flow [2022-12-06 04:23:08,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:08,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:08,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 68 flow [2022-12-06 04:23:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 68 flow [2022-12-06 04:23:08,557 INFO L130 PetriNetUnfolder]: 2/26 cut-off events. [2022-12-06 04:23:08,557 INFO L131 PetriNetUnfolder]: For 2/6 co-relation queries the response was YES. [2022-12-06 04:23:08,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 26 events. 2/26 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 41. Up to 8 conditions per place. [2022-12-06 04:23:08,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 68 flow [2022-12-06 04:23:08,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:23:08,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:08,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:23:08,560 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2022-12-06 04:23:08,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-06 04:23:08,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:08,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:08,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:23:08,561 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-06 04:23:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -940445180, now seen corresponding path program 1 times [2022-12-06 04:23:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:08,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106614667] [2022-12-06 04:23:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:08,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106614667] [2022-12-06 04:23:08,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106614667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:08,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:08,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334146393] [2022-12-06 04:23:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:08,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:23:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:23:08,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:23:08,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:23:08,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:08,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:08,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:23:08,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:09,032 INFO L130 PetriNetUnfolder]: 477/776 cut-off events. [2022-12-06 04:23:09,032 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-06 04:23:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 776 events. 477/776 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3336 event pairs, 133 based on Foata normal form. 12/787 useless extension candidates. Maximal degree in co-relation 1742. Up to 555 conditions per place. [2022-12-06 04:23:09,038 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 04:23:09,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 158 flow [2022-12-06 04:23:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:23:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:23:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:23:09,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 04:23:09,045 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:23:09,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 158 flow [2022-12-06 04:23:09,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:23:09,049 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 72 flow [2022-12-06 04:23:09,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:23:09,053 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 04:23:09,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:09,053 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 72 flow [2022-12-06 04:23:09,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:09,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:09,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 72 flow [2022-12-06 04:23:09,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 72 flow [2022-12-06 04:23:09,064 INFO L130 PetriNetUnfolder]: 2/26 cut-off events. [2022-12-06 04:23:09,065 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-06 04:23:09,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 26 events. 2/26 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 43. Up to 8 conditions per place. [2022-12-06 04:23:09,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 72 flow [2022-12-06 04:23:09,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 04:23:09,067 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:09,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:23:09,074 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 72 flow [2022-12-06 04:23:09,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:09,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:09,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:09,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:23:09,076 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-06 04:23:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 442078090, now seen corresponding path program 1 times [2022-12-06 04:23:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:09,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599360742] [2022-12-06 04:23:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:10,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:10,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599360742] [2022-12-06 04:23:10,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599360742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:10,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:10,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:23:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650473989] [2022-12-06 04:23:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:10,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:23:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:23:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:23:10,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:23:10,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:10,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:10,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:23:10,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:10,628 INFO L130 PetriNetUnfolder]: 493/798 cut-off events. [2022-12-06 04:23:10,629 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2022-12-06 04:23:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 798 events. 493/798 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3426 event pairs, 94 based on Foata normal form. 3/797 useless extension candidates. Maximal degree in co-relation 1937. Up to 623 conditions per place. [2022-12-06 04:23:10,634 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-06 04:23:10,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 219 flow [2022-12-06 04:23:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:23:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:23:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 04:23:10,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 04:23:10,639 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 72 flow. Second operand 4 states and 46 transitions. [2022-12-06 04:23:10,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 219 flow [2022-12-06 04:23:10,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:23:10,642 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 122 flow [2022-12-06 04:23:10,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 04:23:10,645 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-06 04:23:10,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:10,645 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 122 flow [2022-12-06 04:23:10,646 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:10,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:10,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 122 flow [2022-12-06 04:23:10,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 122 flow [2022-12-06 04:23:10,659 INFO L130 PetriNetUnfolder]: 16/75 cut-off events. [2022-12-06 04:23:10,659 INFO L131 PetriNetUnfolder]: For 36/43 co-relation queries the response was YES. [2022-12-06 04:23:10,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 75 events. 16/75 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 305 event pairs, 0 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 163. Up to 19 conditions per place. [2022-12-06 04:23:10,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 122 flow [2022-12-06 04:23:10,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 04:23:10,732 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:10,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 04:23:10,733 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 122 flow [2022-12-06 04:23:10,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:10,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:10,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:10,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:23:10,733 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-06 04:23:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash 193833202, now seen corresponding path program 2 times [2022-12-06 04:23:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:10,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511795756] [2022-12-06 04:23:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:11,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:11,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511795756] [2022-12-06 04:23:11,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511795756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:11,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:11,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:23:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739590992] [2022-12-06 04:23:11,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:11,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:23:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:23:11,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:23:11,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:23:11,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:11,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:11,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:23:11,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:11,929 INFO L130 PetriNetUnfolder]: 484/784 cut-off events. [2022-12-06 04:23:11,930 INFO L131 PetriNetUnfolder]: For 582/589 co-relation queries the response was YES. [2022-12-06 04:23:11,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2208 conditions, 784 events. 484/784 cut-off events. For 582/589 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3387 event pairs, 103 based on Foata normal form. 7/790 useless extension candidates. Maximal degree in co-relation 2192. Up to 617 conditions per place. [2022-12-06 04:23:11,936 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 32 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-06 04:23:11,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 254 flow [2022-12-06 04:23:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:23:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:23:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:23:11,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 04:23:11,938 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 122 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:23:11,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 254 flow [2022-12-06 04:23:11,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:23:11,940 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 155 flow [2022-12-06 04:23:11,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-06 04:23:11,941 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2022-12-06 04:23:11,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:11,941 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 155 flow [2022-12-06 04:23:11,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:11,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:11,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 155 flow [2022-12-06 04:23:11,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 155 flow [2022-12-06 04:23:12,000 INFO L130 PetriNetUnfolder]: 18/79 cut-off events. [2022-12-06 04:23:12,000 INFO L131 PetriNetUnfolder]: For 80/96 co-relation queries the response was YES. [2022-12-06 04:23:12,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 79 events. 18/79 cut-off events. For 80/96 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 325 event pairs, 2 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 200. Up to 19 conditions per place. [2022-12-06 04:23:12,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 155 flow [2022-12-06 04:23:12,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 04:23:12,239 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:12,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-06 04:23:12,240 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 155 flow [2022-12-06 04:23:12,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:12,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:12,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:12,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:23:12,241 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-06 04:23:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1823402059, now seen corresponding path program 1 times [2022-12-06 04:23:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:12,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595217568] [2022-12-06 04:23:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:13,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595217568] [2022-12-06 04:23:13,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595217568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:13,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:13,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:23:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917072694] [2022-12-06 04:23:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:13,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:23:13,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:13,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:23:13,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:23:13,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:23:13,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:13,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:13,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:23:13,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:13,597 INFO L130 PetriNetUnfolder]: 841/1443 cut-off events. [2022-12-06 04:23:13,597 INFO L131 PetriNetUnfolder]: For 1791/1801 co-relation queries the response was YES. [2022-12-06 04:23:13,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4034 conditions, 1443 events. 841/1443 cut-off events. For 1791/1801 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7619 event pairs, 266 based on Foata normal form. 32/1471 useless extension candidates. Maximal degree in co-relation 4015. Up to 806 conditions per place. [2022-12-06 04:23:13,608 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 36 selfloop transitions, 16 changer transitions 0/55 dead transitions. [2022-12-06 04:23:13,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 351 flow [2022-12-06 04:23:13,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:23:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:23:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 04:23:13,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2022-12-06 04:23:13,610 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 155 flow. Second operand 5 states and 51 transitions. [2022-12-06 04:23:13,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 351 flow [2022-12-06 04:23:13,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:13,613 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 255 flow [2022-12-06 04:23:13,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-06 04:23:13,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2022-12-06 04:23:13,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:13,614 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 255 flow [2022-12-06 04:23:13,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:13,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:13,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 255 flow [2022-12-06 04:23:13,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 255 flow [2022-12-06 04:23:13,654 INFO L130 PetriNetUnfolder]: 62/237 cut-off events. [2022-12-06 04:23:13,654 INFO L131 PetriNetUnfolder]: For 411/436 co-relation queries the response was YES. [2022-12-06 04:23:13,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 237 events. 62/237 cut-off events. For 411/436 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1390 event pairs, 10 based on Foata normal form. 9/239 useless extension candidates. Maximal degree in co-relation 673. Up to 64 conditions per place. [2022-12-06 04:23:13,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 255 flow [2022-12-06 04:23:13,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 04:23:13,660 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:13,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 04:23:13,661 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 255 flow [2022-12-06 04:23:13,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:13,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:13,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:13,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:23:13,662 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-06 04:23:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1858015729, now seen corresponding path program 2 times [2022-12-06 04:23:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:13,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631149931] [2022-12-06 04:23:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:14,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631149931] [2022-12-06 04:23:14,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631149931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:14,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:14,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:23:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942007501] [2022-12-06 04:23:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:23:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:23:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:23:14,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:23:14,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:14,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:14,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:23:14,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:15,353 INFO L130 PetriNetUnfolder]: 992/1748 cut-off events. [2022-12-06 04:23:15,354 INFO L131 PetriNetUnfolder]: For 3976/3991 co-relation queries the response was YES. [2022-12-06 04:23:15,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5693 conditions, 1748 events. 992/1748 cut-off events. For 3976/3991 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10031 event pairs, 317 based on Foata normal form. 48/1786 useless extension candidates. Maximal degree in co-relation 5671. Up to 744 conditions per place. [2022-12-06 04:23:15,370 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 41 selfloop transitions, 21 changer transitions 0/65 dead transitions. [2022-12-06 04:23:15,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 467 flow [2022-12-06 04:23:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:23:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:23:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 04:23:15,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 04:23:15,372 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 255 flow. Second operand 6 states and 59 transitions. [2022-12-06 04:23:15,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 467 flow [2022-12-06 04:23:15,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 462 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:15,380 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 354 flow [2022-12-06 04:23:15,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-06 04:23:15,382 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2022-12-06 04:23:15,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:15,382 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 354 flow [2022-12-06 04:23:15,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:15,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:15,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 354 flow [2022-12-06 04:23:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 354 flow [2022-12-06 04:23:15,447 INFO L130 PetriNetUnfolder]: 68/285 cut-off events. [2022-12-06 04:23:15,447 INFO L131 PetriNetUnfolder]: For 1369/1412 co-relation queries the response was YES. [2022-12-06 04:23:15,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 285 events. 68/285 cut-off events. For 1369/1412 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1930 event pairs, 15 based on Foata normal form. 11/285 useless extension candidates. Maximal degree in co-relation 1028. Up to 73 conditions per place. [2022-12-06 04:23:15,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 354 flow [2022-12-06 04:23:15,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 04:23:15,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:15,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 04:23:15,459 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 354 flow [2022-12-06 04:23:15,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:15,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:15,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:15,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:23:15,460 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-06 04:23:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1284323703, now seen corresponding path program 1 times [2022-12-06 04:23:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:15,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799313004] [2022-12-06 04:23:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:15,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799313004] [2022-12-06 04:23:15,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799313004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:15,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:15,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:23:15,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216138835] [2022-12-06 04:23:15,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:15,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:23:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:23:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:23:15,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:23:15,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:15,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:15,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:23:15,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:15,886 INFO L130 PetriNetUnfolder]: 734/1375 cut-off events. [2022-12-06 04:23:15,886 INFO L131 PetriNetUnfolder]: For 5144/5149 co-relation queries the response was YES. [2022-12-06 04:23:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 1375 events. 734/1375 cut-off events. For 5144/5149 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8193 event pairs, 154 based on Foata normal form. 133/1497 useless extension candidates. Maximal degree in co-relation 5112. Up to 897 conditions per place. [2022-12-06 04:23:15,900 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 93 selfloop transitions, 7 changer transitions 8/111 dead transitions. [2022-12-06 04:23:15,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 111 transitions, 1064 flow [2022-12-06 04:23:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:23:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:23:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:23:15,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6105263157894737 [2022-12-06 04:23:15,902 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 354 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:23:15,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 111 transitions, 1064 flow [2022-12-06 04:23:15,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 111 transitions, 1032 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:23:15,911 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 403 flow [2022-12-06 04:23:15,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 04:23:15,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2022-12-06 04:23:15,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:15,912 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 403 flow [2022-12-06 04:23:15,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:15,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:15,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 403 flow [2022-12-06 04:23:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 403 flow [2022-12-06 04:23:16,009 INFO L130 PetriNetUnfolder]: 251/625 cut-off events. [2022-12-06 04:23:16,009 INFO L131 PetriNetUnfolder]: For 1970/2139 co-relation queries the response was YES. [2022-12-06 04:23:16,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 625 events. 251/625 cut-off events. For 1970/2139 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4338 event pairs, 86 based on Foata normal form. 24/596 useless extension candidates. Maximal degree in co-relation 2262. Up to 345 conditions per place. [2022-12-06 04:23:16,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 403 flow [2022-12-06 04:23:16,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 04:23:16,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L852-3-->L4: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_135 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_32) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [638] L811-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P1Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_15|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 04:23:16,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L852-3-->L4: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_135 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_32) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [606] L830-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_17| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1)) (= |v_P2Thread1of1ForFork1_#res.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-06 04:23:16,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:23:16,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 04:23:16,116 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 405 flow [2022-12-06 04:23:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:16,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:16,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:23:16,117 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-06 04:23:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash 337034929, now seen corresponding path program 1 times [2022-12-06 04:23:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107535599] [2022-12-06 04:23:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107535599] [2022-12-06 04:23:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107535599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:17,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:17,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:23:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687843591] [2022-12-06 04:23:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:17,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:23:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:23:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:23:17,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:23:17,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 405 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:17,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:17,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:23:17,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:18,352 INFO L130 PetriNetUnfolder]: 672/1302 cut-off events. [2022-12-06 04:23:18,352 INFO L131 PetriNetUnfolder]: For 4967/4986 co-relation queries the response was YES. [2022-12-06 04:23:18,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 1302 events. 672/1302 cut-off events. For 4967/4986 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7751 event pairs, 196 based on Foata normal form. 21/1316 useless extension candidates. Maximal degree in co-relation 5969. Up to 784 conditions per place. [2022-12-06 04:23:18,365 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 80 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2022-12-06 04:23:18,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 994 flow [2022-12-06 04:23:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:23:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:23:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2022-12-06 04:23:18,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2022-12-06 04:23:18,368 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 405 flow. Second operand 9 states and 88 transitions. [2022-12-06 04:23:18,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 994 flow [2022-12-06 04:23:18,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 109 transitions, 967 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:18,379 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 575 flow [2022-12-06 04:23:18,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2022-12-06 04:23:18,381 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 37 predicate places. [2022-12-06 04:23:18,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:18,381 INFO L89 Accepts]: Start accepts. Operand has 66 places, 62 transitions, 575 flow [2022-12-06 04:23:18,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:18,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:18,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 62 transitions, 575 flow [2022-12-06 04:23:18,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 575 flow [2022-12-06 04:23:18,478 INFO L130 PetriNetUnfolder]: 265/672 cut-off events. [2022-12-06 04:23:18,478 INFO L131 PetriNetUnfolder]: For 3560/3671 co-relation queries the response was YES. [2022-12-06 04:23:18,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 672 events. 265/672 cut-off events. For 3560/3671 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4741 event pairs, 92 based on Foata normal form. 13/627 useless extension candidates. Maximal degree in co-relation 2669. Up to 357 conditions per place. [2022-12-06 04:23:18,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 62 transitions, 575 flow [2022-12-06 04:23:18,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-06 04:23:18,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] L795-->L811: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_139 256) 0)) (.cse12 (= (mod v_~x$w_buff1_used~0_141 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd2~0_42 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd2~0_47 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice2~0_76 256) 0)) (.cse3 (and .cse8 .cse10)) (.cse5 (and .cse12 .cse10)) (.cse14 (select |v_#memory_int_190| |v_~#x~0.base_127|)) (.cse11 (not .cse10)) (.cse13 (not .cse16))) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse11 .cse13)) (.cse9 (select .cse14 |v_~#x~0.offset_127|)) (.cse1 (or .cse3 .cse16 .cse5)) (.cse0 (not .cse15))) (and (= (ite .cse0 v_~x$w_buff0_used~0_139 (ite .cse1 v_~x$w_buff0_used~0_139 (ite .cse2 0 v_~x$w_buff0_used~0_139))) v_~x$w_buff0_used~0_138) (= (ite .cse0 v_~x$w_buff1_used~0_141 (ite (or .cse3 .cse4 .cse5) v_~x$w_buff1_used~0_141 0)) v_~x$w_buff1_used~0_140) (= v_~x$r_buff1_thd2~0_41 (ite .cse0 v_~x$r_buff1_thd2~0_42 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_46 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse6))) v_~x$r_buff1_thd2~0_42 0))) (= |v_P1Thread1of1ForFork0_#t~nondet11_1| v_~weak$$choice0~0_18) (= .cse9 v_~x$mem_tmp~0_28) (= v_~x$w_buff1~0_61 v_~x$w_buff1~0_60) (= v_~x$r_buff0_thd2~0_46 (ite .cse0 v_~x$r_buff0_thd2~0_47 (ite (or .cse3 .cse4 (and .cse10 .cse7)) v_~x$r_buff0_thd2~0_47 (ite (and (not .cse4) .cse11) 0 v_~x$r_buff0_thd2~0_47)))) (= v_~x$w_buff0~0_53 v_~x$w_buff0~0_52) (= |v_P1Thread1of1ForFork0_#t~nondet12_1| v_~weak$$choice2~0_76) (or (and (or .cse11 (not .cse12)) (or .cse11 (not .cse8)) (= v_~__unbuffered_p1_EBX~0_20 (ite .cse2 v_~x$w_buff0~0_53 v_~x$w_buff1~0_61)) .cse13 (= |v_P1Thread1of1ForFork0_#t~mem14_1| |v_P1_#t~mem14_30|)) (and (= .cse9 |v_P1_#t~mem14_30|) (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem14_30|) .cse1)) (= (store |v_#memory_int_190| |v_~#x~0.base_127| (store .cse14 |v_~#x~0.offset_127| |v_P1_#t~ite18_37|)) |v_#memory_int_189|) (or (and .cse15 (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem17_32|) (= |v_P1_#t~ite18_37| |v_P1_#t~mem17_32|)) (and .cse0 (= |v_P1Thread1of1ForFork0_#t~mem17_1| |v_P1_#t~mem17_32|) (= |v_P1_#t~ite18_37| v_~x$mem_tmp~0_28))) (= v_~x$flush_delayed~0_52 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, P1Thread1of1ForFork0_#t~mem14=|v_P1Thread1of1ForFork0_#t~mem14_1|, ~#x~0.offset=|v_~#x~0.offset_127|, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_139, #memory_int=|v_#memory_int_190|, ~#x~0.base=|v_~#x~0.base_127|, P1Thread1of1ForFork0_#t~mem17=|v_P1Thread1of1ForFork0_#t~mem17_1|, P1Thread1of1ForFork0_#t~nondet12=|v_P1Thread1of1ForFork0_#t~nondet12_1|, P1Thread1of1ForFork0_#t~nondet11=|v_P1Thread1of1ForFork0_#t~nondet11_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~x$flush_delayed~0=v_~x$flush_delayed~0_52, ~#x~0.offset=|v_~#x~0.offset_127|, ~x$w_buff1~0=v_~x$w_buff1~0_60, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$mem_tmp~0=v_~x$mem_tmp~0_28, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_46, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_1|, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138, ~weak$$choice0~0=v_~weak$$choice0~0_18, #memory_int=|v_#memory_int_189|, ~#x~0.base=|v_~#x~0.base_127|, P1Thread1of1ForFork0_#t~mem16=|v_P1Thread1of1ForFork0_#t~mem16_1|, ~weak$$choice2~0=v_~weak$$choice2~0_76} AuxVars[|v_P1_#t~mem17_32|, |v_P1_#t~mem14_30|, |v_P1_#t~ite18_37|] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~mem14, ~x$flush_delayed~0, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P1Thread1of1ForFork0_#t~mem16, P1Thread1of1ForFork0_#t~mem17, ~weak$$choice2~0, P1Thread1of1ForFork0_#t~nondet12, P1Thread1of1ForFork0_#t~nondet11] and [539] L822-->L830: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_34 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))) (.cse1 (not .cse10)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_30 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_153 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_157 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not .cse9)) (.cse7 (select |v_#memory_int_214| |v_~#x~0.base_139|)) (.cse3 (not .cse6)) (.cse4 (and .cse11 .cse1))) (and (= v_~x$w_buff0_used~0_152 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_153)) (= (ite (or (and .cse2 .cse3) .cse4) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156) (let ((.cse8 (= |v_P2_#t~mem19_30| |v_P2Thread1of1ForFork1_#t~mem19_1|))) (or (and (= |v_P2_#t~ite20_27| |v_P2_#t~ite21_27|) (or (and (or .cse5 .cse6) (= |v_P2_#t~ite20_27| |v_P2_#t~mem19_30|) (= (select .cse7 |v_~#x~0.offset_139|) |v_P2_#t~mem19_30|)) (and .cse2 (= |v_P2_#t~ite20_27| v_~x$w_buff1~0_74) .cse3 .cse8)) (or .cse9 .cse10)) (and .cse0 (= |v_P2_#t~ite20_27| |v_P2Thread1of1ForFork1_#t~ite20_1|) .cse1 .cse8 (= |v_P2_#t~ite21_27| v_~x$w_buff0~0_58)))) (= (store |v_#memory_int_214| |v_~#x~0.base_139| (store .cse7 |v_~#x~0.offset_139| |v_P2_#t~ite21_27|)) |v_#memory_int_213|) (= v_~x$r_buff1_thd3~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_30)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_1|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_214|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_213|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} AuxVars[|v_P2_#t~ite20_27|, |v_P2_#t~mem19_30|, |v_P2_#t~ite21_27|] AssignedVars[P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:23:19,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] L863-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|) (let ((.cse0 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_77 256) 0)) (.cse2 (= |v_ULTIMATE.start_main_#t~mem32#1_119| |v_ULTIMATE.start_main_#t~mem32#1_117|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_57 256) 0))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite33#1_114| v_~__unbuffered_p0_EAX~0_110) .cse2) (and (= (select (select |v_#memory_int_411| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_80) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_80) |v_ULTIMATE.start_main_#t~mem32#1_117|) (= |v_ULTIMATE.start_main_#t~ite33#1_114| |v_ULTIMATE.start_main_#t~mem32#1_117|) (not .cse1)))) (= |v_ULTIMATE.start_main_#t~ite33#1_114| v_~__unbuffered_p0_EAX~0_109)) (and (= |v_ULTIMATE.start_main_#t~ite33#1_116| |v_ULTIMATE.start_main_#t~ite33#1_114|) .cse0 (= v_~__unbuffered_p0_EAX~0_109 v_~__unbuffered_p0_EAX~0_110) .cse2))) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_45) (= v_~y~0_62 2) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~__unbuffered_p0_EAX~0_109 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_52) (= |v_ULTIMATE.start_main_#t~nondet31#1_77| v_~weak$$choice1~0_57) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23| 0)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_119|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_116|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_80, #memory_int=|v_#memory_int_411|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_77|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_77, ~y~0=v_~y~0_62, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_80} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_64|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, ~weak$$choice1~0=v_~weak$$choice1~0_57, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_80, #memory_int=|v_#memory_int_411|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_77, ~y~0=v_~y~0_62} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_114|, |v_ULTIMATE.start_main_#t~mem32#1_117|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0] and [644] L795-->L830: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd2~0_150 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_508 256) 0)) (.cse24 (= (mod v_~x$r_buff0_thd2~0_149 256) 0)) (.cse27 (= (mod v_~x$w_buff0_used~0_498 256) 0))) (let ((.cse6 (not .cse27)) (.cse5 (not .cse24)) (.cse26 (and .cse24 .cse8)) (.cse25 (and .cse24 .cse4)) (.cse9 (= (mod v_~weak$$choice2~0_180 256) 0))) (let ((.cse10 (not .cse9)) (.cse2 (or .cse26 .cse25 .cse27)) (.cse7 (and .cse6 .cse5))) (let ((.cse21 (ite .cse10 v_~x$w_buff0_used~0_498 (ite .cse2 v_~x$w_buff0_used~0_498 (ite .cse7 0 v_~x$w_buff0_used~0_498))))) (let ((.cse18 (= (mod .cse21 256) 0))) (let ((.cse19 (= (mod v_~x$r_buff0_thd3~0_108 256) 0)) (.cse22 (ite .cse10 v_~x$w_buff1_used~0_508 (ite (or .cse26 .cse18 .cse25) v_~x$w_buff1_used~0_508 0)))) (let ((.cse14 (= (mod .cse22 256) 0)) (.cse15 (= (mod v_~x$r_buff1_thd3~0_108 256) 0)) (.cse11 (not .cse19)) (.cse20 (not (= (mod v_~x$w_buff0_used~0_496 256) 0))) (.cse0 (select |v_#memory_int_717| |v_~#x~0.base_321|))) (let ((.cse3 (select .cse0 |v_~#x~0.offset_321|)) (.cse1 (and .cse11 .cse20)) (.cse16 (not .cse15)) (.cse17 (not .cse14)) (.cse12 (not .cse18))) (and (= |v_#memory_int_715| (store |v_#memory_int_717| |v_~#x~0.base_321| (store .cse0 |v_~#x~0.offset_321| |v_P2_#t~ite21_54|))) (= v_~x$w_buff0~0_303 v_~x$w_buff0~0_302) (= |v_P1Thread1of1ForFork0_#t~nondet11_82| v_~weak$$choice0~0_124) (= v_~weak$$choice2~0_180 |v_P1Thread1of1ForFork0_#t~nondet12_82|) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_108) v_~x$r_buff0_thd3~0_107) (or (and .cse2 (= .cse3 |v_P1_#t~mem14_73|) (= v_~__unbuffered_p1_EBX~0_140 |v_P1_#t~mem14_73|)) (and (or (not .cse4) .cse5) .cse6 (= (ite .cse7 v_~x$w_buff0~0_303 v_~x$w_buff1~0_317) v_~__unbuffered_p1_EBX~0_140) (or .cse5 (not .cse8)) (= |v_P1Thread1of1ForFork0_#t~mem14_82| |v_P1_#t~mem14_73|))) (or (and .cse9 (= |v_P1_#t~ite18_80| |v_P1_#t~mem17_75|) (= v_~__unbuffered_p1_EBX~0_140 |v_P1_#t~mem17_75|)) (and (= |v_P1Thread1of1ForFork0_#t~mem17_82| |v_P1_#t~mem17_75|) (= |v_P1_#t~ite18_80| v_~x$mem_tmp~0_134) .cse10)) (= .cse3 v_~x$mem_tmp~0_134) (= v_~x$flush_delayed~0_164 0) (let ((.cse13 (= |v_P2Thread1of1ForFork1_#t~mem19_54| |v_P2_#t~mem19_57|))) (or (and (= |v_P2_#t~ite21_54| v_~x$w_buff0~0_302) .cse11 .cse12 .cse13 (= |v_P2_#t~ite20_54| |v_P2Thread1of1ForFork1_#t~ite20_54|)) (and (= |v_P2_#t~ite20_54| |v_P2_#t~ite21_54|) (or (and (or .cse14 .cse15) (= |v_P2_#t~ite20_54| |v_P2_#t~mem19_57|) (= |v_P1_#t~ite18_80| |v_P2_#t~mem19_57|)) (and .cse16 .cse17 .cse13 (= |v_P2_#t~ite20_54| v_~x$w_buff1~0_316))) (or .cse18 .cse19)))) (= (ite (or (and (not (= 0 (mod v_~x$r_buff0_thd3~0_107 256))) .cse20) (and .cse16 (not (= (mod v_~x$w_buff1_used~0_506 256) 0)))) 0 v_~x$r_buff1_thd3~0_108) v_~x$r_buff1_thd3~0_107) (= v_~x$w_buff0_used~0_496 (ite (and .cse11 .cse12) 0 .cse21)) (= v_~x$w_buff1~0_317 v_~x$w_buff1~0_316) (= v_~x$w_buff1_used~0_506 (ite (or .cse1 (and .cse16 .cse17)) 0 .cse22)) (= (ite .cse10 v_~x$r_buff1_thd2~0_150 (ite (let ((.cse23 (= (mod v_~x$r_buff0_thd2~0_148 256) 0))) (or .cse18 (and .cse23 .cse14) (and .cse23 .cse4))) v_~x$r_buff1_thd2~0_150 0)) v_~x$r_buff1_thd2~0_149) (= (ite .cse10 v_~x$r_buff0_thd2~0_149 (ite (or (and .cse14 .cse24) .cse18 .cse25) v_~x$r_buff0_thd2~0_149 (ite (and .cse12 .cse5) 0 v_~x$r_buff0_thd2~0_149))) v_~x$r_buff0_thd2~0_148)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_303, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_54|, P1Thread1of1ForFork0_#t~mem14=|v_P1Thread1of1ForFork0_#t~mem14_82|, ~#x~0.offset=|v_~#x~0.offset_321|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_108, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_508, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_150, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_108, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_149, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_498, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_54|, #memory_int=|v_#memory_int_717|, ~#x~0.base=|v_~#x~0.base_321|, P1Thread1of1ForFork0_#t~mem17=|v_P1Thread1of1ForFork0_#t~mem17_82|, P1Thread1of1ForFork0_#t~nondet12=|v_P1Thread1of1ForFork0_#t~nondet12_82|, P1Thread1of1ForFork0_#t~nondet11=|v_P1Thread1of1ForFork0_#t~nondet11_82|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_302, ~x$flush_delayed~0=v_~x$flush_delayed~0_164, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$mem_tmp~0=v_~x$mem_tmp~0_134, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_140, ~#x~0.offset=|v_~#x~0.offset_321|, ~x$w_buff1~0=v_~x$w_buff1~0_316, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_506, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_148, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_43|, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_43|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496, ~weak$$choice0~0=v_~weak$$choice0~0_124, #memory_int=|v_#memory_int_715|, ~#x~0.base=|v_~#x~0.base_321|, P1Thread1of1ForFork0_#t~mem16=|v_P1Thread1of1ForFork0_#t~mem16_43|, ~weak$$choice2~0=v_~weak$$choice2~0_180} AuxVars[|v_P1_#t~mem17_75|, |v_P2_#t~ite20_54|, |v_P2_#t~ite21_54|, |v_P1_#t~mem14_73|, |v_P1_#t~ite18_80|, |v_P2_#t~mem19_57|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, P1Thread1of1ForFork0_#t~nondet12, P1Thread1of1ForFork0_#t~nondet11, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~mem14, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P1Thread1of1ForFork0_#t~mem16, P1Thread1of1ForFork0_#t~mem17, ~weak$$choice2~0] [2022-12-06 04:23:21,493 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:23:21,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3113 [2022-12-06 04:23:21,494 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 590 flow [2022-12-06 04:23:21,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:21,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:21,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:23:21,495 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-06 04:23:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash 981016457, now seen corresponding path program 2 times [2022-12-06 04:23:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089262941] [2022-12-06 04:23:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089262941] [2022-12-06 04:23:21,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089262941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:21,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:21,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:23:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140541643] [2022-12-06 04:23:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:21,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:23:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:23:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:23:21,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:23:21,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 590 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:21,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:21,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:23:21,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:21,966 INFO L130 PetriNetUnfolder]: 456/953 cut-off events. [2022-12-06 04:23:21,966 INFO L131 PetriNetUnfolder]: For 4912/4917 co-relation queries the response was YES. [2022-12-06 04:23:21,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 953 events. 456/953 cut-off events. For 4912/4917 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5734 event pairs, 42 based on Foata normal form. 97/1044 useless extension candidates. Maximal degree in co-relation 4494. Up to 464 conditions per place. [2022-12-06 04:23:21,978 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 105 selfloop transitions, 12 changer transitions 26/146 dead transitions. [2022-12-06 04:23:21,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 146 transitions, 1642 flow [2022-12-06 04:23:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:23:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:23:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 04:23:21,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 04:23:21,980 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 590 flow. Second operand 6 states and 72 transitions. [2022-12-06 04:23:21,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 146 transitions, 1642 flow [2022-12-06 04:23:21,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 146 transitions, 1557 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:21,993 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 577 flow [2022-12-06 04:23:21,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2022-12-06 04:23:21,993 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2022-12-06 04:23:21,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:21,993 INFO L89 Accepts]: Start accepts. Operand has 72 places, 63 transitions, 577 flow [2022-12-06 04:23:21,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:21,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:21,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 577 flow [2022-12-06 04:23:21,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 577 flow [2022-12-06 04:23:22,059 INFO L130 PetriNetUnfolder]: 107/402 cut-off events. [2022-12-06 04:23:22,060 INFO L131 PetriNetUnfolder]: For 2078/2380 co-relation queries the response was YES. [2022-12-06 04:23:22,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 402 events. 107/402 cut-off events. For 2078/2380 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2863 event pairs, 11 based on Foata normal form. 19/402 useless extension candidates. Maximal degree in co-relation 1840. Up to 243 conditions per place. [2022-12-06 04:23:22,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 63 transitions, 577 flow [2022-12-06 04:23:22,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 04:23:22,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] L863-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|) (let ((.cse0 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_77 256) 0)) (.cse2 (= |v_ULTIMATE.start_main_#t~mem32#1_119| |v_ULTIMATE.start_main_#t~mem32#1_117|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_57 256) 0))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite33#1_114| v_~__unbuffered_p0_EAX~0_110) .cse2) (and (= (select (select |v_#memory_int_411| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_80) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_80) |v_ULTIMATE.start_main_#t~mem32#1_117|) (= |v_ULTIMATE.start_main_#t~ite33#1_114| |v_ULTIMATE.start_main_#t~mem32#1_117|) (not .cse1)))) (= |v_ULTIMATE.start_main_#t~ite33#1_114| v_~__unbuffered_p0_EAX~0_109)) (and (= |v_ULTIMATE.start_main_#t~ite33#1_116| |v_ULTIMATE.start_main_#t~ite33#1_114|) .cse0 (= v_~__unbuffered_p0_EAX~0_109 v_~__unbuffered_p0_EAX~0_110) .cse2))) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_45) (= v_~y~0_62 2) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~__unbuffered_p0_EAX~0_109 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_52) (= |v_ULTIMATE.start_main_#t~nondet31#1_77| v_~weak$$choice1~0_57) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_23| 0)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_119|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_116|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_80, #memory_int=|v_#memory_int_411|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_77|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_77, ~y~0=v_~y~0_62, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_80} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_64|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, ~weak$$choice1~0=v_~weak$$choice1~0_57, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_80, #memory_int=|v_#memory_int_411|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_77, ~y~0=v_~y~0_62} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_114|, |v_ULTIMATE.start_main_#t~mem32#1_117|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0] and [539] L822-->L830: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_34 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))) (.cse1 (not .cse10)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_30 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_153 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_157 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not .cse9)) (.cse7 (select |v_#memory_int_214| |v_~#x~0.base_139|)) (.cse3 (not .cse6)) (.cse4 (and .cse11 .cse1))) (and (= v_~x$w_buff0_used~0_152 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_153)) (= (ite (or (and .cse2 .cse3) .cse4) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156) (let ((.cse8 (= |v_P2_#t~mem19_30| |v_P2Thread1of1ForFork1_#t~mem19_1|))) (or (and (= |v_P2_#t~ite20_27| |v_P2_#t~ite21_27|) (or (and (or .cse5 .cse6) (= |v_P2_#t~ite20_27| |v_P2_#t~mem19_30|) (= (select .cse7 |v_~#x~0.offset_139|) |v_P2_#t~mem19_30|)) (and .cse2 (= |v_P2_#t~ite20_27| v_~x$w_buff1~0_74) .cse3 .cse8)) (or .cse9 .cse10)) (and .cse0 (= |v_P2_#t~ite20_27| |v_P2Thread1of1ForFork1_#t~ite20_1|) .cse1 .cse8 (= |v_P2_#t~ite21_27| v_~x$w_buff0~0_58)))) (= (store |v_#memory_int_214| |v_~#x~0.base_139| (store .cse7 |v_~#x~0.offset_139| |v_P2_#t~ite21_27|)) |v_#memory_int_213|) (= v_~x$r_buff1_thd3~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_30)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_1|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_214|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_213|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} AuxVars[|v_P2_#t~ite20_27|, |v_P2_#t~mem19_30|, |v_P2_#t~ite21_27|] AssignedVars[P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:23:22,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:23:22,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 727 [2022-12-06 04:23:22,720 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 584 flow [2022-12-06 04:23:22,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:22,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:22,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:22,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:23:22,721 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2019965913, now seen corresponding path program 1 times [2022-12-06 04:23:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271633934] [2022-12-06 04:23:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:22,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:22,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:22,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271633934] [2022-12-06 04:23:22,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271633934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:22,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:22,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:23:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232270592] [2022-12-06 04:23:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:22,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:23:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:22,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:23:22,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:23:22,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:23:22,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:22,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:22,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:23:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:23,158 INFO L130 PetriNetUnfolder]: 365/794 cut-off events. [2022-12-06 04:23:23,160 INFO L131 PetriNetUnfolder]: For 4465/4470 co-relation queries the response was YES. [2022-12-06 04:23:23,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4176 conditions, 794 events. 365/794 cut-off events. For 4465/4470 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4769 event pairs, 29 based on Foata normal form. 33/824 useless extension candidates. Maximal degree in co-relation 4138. Up to 387 conditions per place. [2022-12-06 04:23:23,169 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 93 selfloop transitions, 16 changer transitions 27/139 dead transitions. [2022-12-06 04:23:23,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 139 transitions, 1550 flow [2022-12-06 04:23:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:23:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:23:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-06 04:23:23,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-06 04:23:23,171 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 584 flow. Second operand 8 states and 76 transitions. [2022-12-06 04:23:23,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 139 transitions, 1550 flow [2022-12-06 04:23:23,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 139 transitions, 1340 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-12-06 04:23:23,188 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 482 flow [2022-12-06 04:23:23,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=482, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2022-12-06 04:23:23,189 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 04:23:23,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:23,189 INFO L89 Accepts]: Start accepts. Operand has 73 places, 57 transitions, 482 flow [2022-12-06 04:23:23,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:23,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:23,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 57 transitions, 482 flow [2022-12-06 04:23:23,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 57 transitions, 482 flow [2022-12-06 04:23:23,233 INFO L130 PetriNetUnfolder]: 68/308 cut-off events. [2022-12-06 04:23:23,234 INFO L131 PetriNetUnfolder]: For 1097/1191 co-relation queries the response was YES. [2022-12-06 04:23:23,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 308 events. 68/308 cut-off events. For 1097/1191 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2176 event pairs, 1 based on Foata normal form. 11/303 useless extension candidates. Maximal degree in co-relation 1282. Up to 105 conditions per place. [2022-12-06 04:23:23,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 57 transitions, 482 flow [2022-12-06 04:23:23,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-06 04:23:24,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] L795-->L811: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_139 256) 0)) (.cse12 (= (mod v_~x$w_buff1_used~0_141 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd2~0_42 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd2~0_47 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice2~0_76 256) 0)) (.cse3 (and .cse8 .cse10)) (.cse5 (and .cse12 .cse10)) (.cse14 (select |v_#memory_int_190| |v_~#x~0.base_127|)) (.cse11 (not .cse10)) (.cse13 (not .cse16))) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse11 .cse13)) (.cse9 (select .cse14 |v_~#x~0.offset_127|)) (.cse1 (or .cse3 .cse16 .cse5)) (.cse0 (not .cse15))) (and (= (ite .cse0 v_~x$w_buff0_used~0_139 (ite .cse1 v_~x$w_buff0_used~0_139 (ite .cse2 0 v_~x$w_buff0_used~0_139))) v_~x$w_buff0_used~0_138) (= (ite .cse0 v_~x$w_buff1_used~0_141 (ite (or .cse3 .cse4 .cse5) v_~x$w_buff1_used~0_141 0)) v_~x$w_buff1_used~0_140) (= v_~x$r_buff1_thd2~0_41 (ite .cse0 v_~x$r_buff1_thd2~0_42 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_46 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse6))) v_~x$r_buff1_thd2~0_42 0))) (= |v_P1Thread1of1ForFork0_#t~nondet11_1| v_~weak$$choice0~0_18) (= .cse9 v_~x$mem_tmp~0_28) (= v_~x$w_buff1~0_61 v_~x$w_buff1~0_60) (= v_~x$r_buff0_thd2~0_46 (ite .cse0 v_~x$r_buff0_thd2~0_47 (ite (or .cse3 .cse4 (and .cse10 .cse7)) v_~x$r_buff0_thd2~0_47 (ite (and (not .cse4) .cse11) 0 v_~x$r_buff0_thd2~0_47)))) (= v_~x$w_buff0~0_53 v_~x$w_buff0~0_52) (= |v_P1Thread1of1ForFork0_#t~nondet12_1| v_~weak$$choice2~0_76) (or (and (or .cse11 (not .cse12)) (or .cse11 (not .cse8)) (= v_~__unbuffered_p1_EBX~0_20 (ite .cse2 v_~x$w_buff0~0_53 v_~x$w_buff1~0_61)) .cse13 (= |v_P1Thread1of1ForFork0_#t~mem14_1| |v_P1_#t~mem14_30|)) (and (= .cse9 |v_P1_#t~mem14_30|) (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem14_30|) .cse1)) (= (store |v_#memory_int_190| |v_~#x~0.base_127| (store .cse14 |v_~#x~0.offset_127| |v_P1_#t~ite18_37|)) |v_#memory_int_189|) (or (and .cse15 (= v_~__unbuffered_p1_EBX~0_20 |v_P1_#t~mem17_32|) (= |v_P1_#t~ite18_37| |v_P1_#t~mem17_32|)) (and .cse0 (= |v_P1Thread1of1ForFork0_#t~mem17_1| |v_P1_#t~mem17_32|) (= |v_P1_#t~ite18_37| v_~x$mem_tmp~0_28))) (= v_~x$flush_delayed~0_52 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, P1Thread1of1ForFork0_#t~mem14=|v_P1Thread1of1ForFork0_#t~mem14_1|, ~#x~0.offset=|v_~#x~0.offset_127|, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_139, #memory_int=|v_#memory_int_190|, ~#x~0.base=|v_~#x~0.base_127|, P1Thread1of1ForFork0_#t~mem17=|v_P1Thread1of1ForFork0_#t~mem17_1|, P1Thread1of1ForFork0_#t~nondet12=|v_P1Thread1of1ForFork0_#t~nondet12_1|, P1Thread1of1ForFork0_#t~nondet11=|v_P1Thread1of1ForFork0_#t~nondet11_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~x$flush_delayed~0=v_~x$flush_delayed~0_52, ~#x~0.offset=|v_~#x~0.offset_127|, ~x$w_buff1~0=v_~x$w_buff1~0_60, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$mem_tmp~0=v_~x$mem_tmp~0_28, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_46, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_1|, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138, ~weak$$choice0~0=v_~weak$$choice0~0_18, #memory_int=|v_#memory_int_189|, ~#x~0.base=|v_~#x~0.base_127|, P1Thread1of1ForFork0_#t~mem16=|v_P1Thread1of1ForFork0_#t~mem16_1|, ~weak$$choice2~0=v_~weak$$choice2~0_76} AuxVars[|v_P1_#t~mem17_32|, |v_P1_#t~mem14_30|, |v_P1_#t~ite18_37|] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~mem14, ~x$flush_delayed~0, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P1Thread1of1ForFork0_#t~mem16, P1Thread1of1ForFork0_#t~mem17, ~weak$$choice2~0, P1Thread1of1ForFork0_#t~nondet12, P1Thread1of1ForFork0_#t~nondet11] and [539] L822-->L830: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_34 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))) (.cse1 (not .cse10)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_30 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_153 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_157 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not .cse9)) (.cse7 (select |v_#memory_int_214| |v_~#x~0.base_139|)) (.cse3 (not .cse6)) (.cse4 (and .cse11 .cse1))) (and (= v_~x$w_buff0_used~0_152 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_153)) (= (ite (or (and .cse2 .cse3) .cse4) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156) (let ((.cse8 (= |v_P2_#t~mem19_30| |v_P2Thread1of1ForFork1_#t~mem19_1|))) (or (and (= |v_P2_#t~ite20_27| |v_P2_#t~ite21_27|) (or (and (or .cse5 .cse6) (= |v_P2_#t~ite20_27| |v_P2_#t~mem19_30|) (= (select .cse7 |v_~#x~0.offset_139|) |v_P2_#t~mem19_30|)) (and .cse2 (= |v_P2_#t~ite20_27| v_~x$w_buff1~0_74) .cse3 .cse8)) (or .cse9 .cse10)) (and .cse0 (= |v_P2_#t~ite20_27| |v_P2Thread1of1ForFork1_#t~ite20_1|) .cse1 .cse8 (= |v_P2_#t~ite21_27| v_~x$w_buff0~0_58)))) (= (store |v_#memory_int_214| |v_~#x~0.base_139| (store .cse7 |v_~#x~0.offset_139| |v_P2_#t~ite21_27|)) |v_#memory_int_213|) (= v_~x$r_buff1_thd3~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_30)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_1|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_214|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_213|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} AuxVars[|v_P2_#t~ite20_27|, |v_P2_#t~mem19_30|, |v_P2_#t~ite21_27|] AssignedVars[P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:23:25,780 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:23:25,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2592 [2022-12-06 04:23:25,781 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 482 flow [2022-12-06 04:23:25,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:25,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:25,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:25,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:23:25,782 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -544493106, now seen corresponding path program 1 times [2022-12-06 04:23:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:25,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020459771] [2022-12-06 04:23:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:23:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020459771] [2022-12-06 04:23:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020459771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:23:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712331393] [2022-12-06 04:23:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:26,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:23:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:23:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:23:26,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:23:26,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:26,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:26,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:23:26,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:26,859 INFO L130 PetriNetUnfolder]: 388/883 cut-off events. [2022-12-06 04:23:26,859 INFO L131 PetriNetUnfolder]: For 4148/4151 co-relation queries the response was YES. [2022-12-06 04:23:26,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 883 events. 388/883 cut-off events. For 4148/4151 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5598 event pairs, 115 based on Foata normal form. 2/878 useless extension candidates. Maximal degree in co-relation 4412. Up to 334 conditions per place. [2022-12-06 04:23:26,872 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 56 selfloop transitions, 13 changer transitions 12/84 dead transitions. [2022-12-06 04:23:26,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 898 flow [2022-12-06 04:23:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:23:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:23:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 04:23:26,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2022-12-06 04:23:26,874 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 482 flow. Second operand 5 states and 47 transitions. [2022-12-06 04:23:26,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 898 flow [2022-12-06 04:23:26,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 756 flow, removed 35 selfloop flow, removed 9 redundant places. [2022-12-06 04:23:26,894 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 420 flow [2022-12-06 04:23:26,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=420, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2022-12-06 04:23:26,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2022-12-06 04:23:26,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:26,895 INFO L89 Accepts]: Start accepts. Operand has 65 places, 53 transitions, 420 flow [2022-12-06 04:23:26,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:26,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:26,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 53 transitions, 420 flow [2022-12-06 04:23:26,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 420 flow [2022-12-06 04:23:26,931 INFO L130 PetriNetUnfolder]: 64/295 cut-off events. [2022-12-06 04:23:26,931 INFO L131 PetriNetUnfolder]: For 613/657 co-relation queries the response was YES. [2022-12-06 04:23:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 295 events. 64/295 cut-off events. For 613/657 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2092 event pairs, 1 based on Foata normal form. 11/295 useless extension candidates. Maximal degree in co-relation 1022. Up to 79 conditions per place. [2022-12-06 04:23:26,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 53 transitions, 420 flow [2022-12-06 04:23:26,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 04:23:26,937 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:26,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 04:23:26,938 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 420 flow [2022-12-06 04:23:26,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:26,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:26,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:26,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:23:26,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash -219630806, now seen corresponding path program 2 times [2022-12-06 04:23:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:26,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851560863] [2022-12-06 04:23:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:23:27,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:23:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:23:27,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:23:27,127 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:23:27,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:23:27,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:23:27,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:23:27,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:23:27,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:23:27,130 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:27,134 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:23:27,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:23:27,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:23:27 BasicIcfg [2022-12-06 04:23:27,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:23:27,240 INFO L158 Benchmark]: Toolchain (without parser) took 29917.30ms. Allocated memory was 187.7MB in the beginning and 802.2MB in the end (delta: 614.5MB). Free memory was 162.1MB in the beginning and 629.5MB in the end (delta: -467.4MB). Peak memory consumption was 148.1MB. Max. memory is 8.0GB. [2022-12-06 04:23:27,240 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:23:27,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.18ms. Allocated memory is still 187.7MB. Free memory was 162.1MB in the beginning and 134.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:23:27,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.50ms. Allocated memory is still 187.7MB. Free memory was 134.8MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:23:27,241 INFO L158 Benchmark]: Boogie Preprocessor took 42.79ms. Allocated memory is still 187.7MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:23:27,241 INFO L158 Benchmark]: RCFGBuilder took 951.36ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 130.2MB in the beginning and 218.0MB in the end (delta: -87.8MB). Peak memory consumption was 50.5MB. Max. memory is 8.0GB. [2022-12-06 04:23:27,241 INFO L158 Benchmark]: TraceAbstraction took 28298.08ms. Allocated memory was 255.9MB in the beginning and 802.2MB in the end (delta: 546.3MB). Free memory was 217.0MB in the beginning and 629.5MB in the end (delta: -412.6MB). Peak memory consumption was 134.3MB. Max. memory is 8.0GB. [2022-12-06 04:23:27,243 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.11ms. Allocated memory is still 187.7MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.18ms. Allocated memory is still 187.7MB. Free memory was 162.1MB in the beginning and 134.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.50ms. Allocated memory is still 187.7MB. Free memory was 134.8MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.79ms. Allocated memory is still 187.7MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 951.36ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 130.2MB in the beginning and 218.0MB in the end (delta: -87.8MB). Peak memory consumption was 50.5MB. Max. memory is 8.0GB. * TraceAbstraction took 28298.08ms. Allocated memory was 255.9MB in the beginning and 802.2MB in the end (delta: 546.3MB). Free memory was 217.0MB in the beginning and 629.5MB in the end (delta: -412.6MB). Peak memory consumption was 134.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 118 PlacesBefore, 29 PlacesAfterwards, 109 TransitionsBefore, 20 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 971, independent: 904, independent conditional: 904, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 971, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 971, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 971, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 792, independent: 750, independent conditional: 0, independent unconditional: 750, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 792, independent: 730, independent conditional: 0, independent unconditional: 730, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 971, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 792, unknown conditional: 0, unknown unconditional: 792] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1158, Positive conditional cache size: 0, Positive unconditional cache size: 1158, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 35, independent conditional: 35, 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: 53, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 53, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 53, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 37, independent conditional: 37, 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: 52, independent: 37, independent conditional: 2, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 52, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 40, independent conditional: 40, 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: 55, independent: 40, independent conditional: 12, independent unconditional: 28, 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: 55, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 55, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 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] , 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: 55, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, 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: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 40, independent conditional: 6, independent unconditional: 34, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 54, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, 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: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 34, 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: 46, independent: 34, independent conditional: 12, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 34, independent conditional: 11, independent unconditional: 23, 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: 46, independent: 34, independent conditional: 11, independent unconditional: 23, 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: 10, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 27, independent conditional: 8, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 53, Positive conditional cache size: 3, Positive unconditional cache size: 50, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 70, independent conditional: 70, 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: 85, independent: 70, independent conditional: 37, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 70, independent conditional: 29, independent unconditional: 41, 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: 85, independent: 70, independent conditional: 29, independent unconditional: 41, 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: 23, independent: 23, independent conditional: 15, independent unconditional: 8, 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: 23, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232, independent: 232, independent conditional: 232, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, independent: 47, independent conditional: 14, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 23, unknown conditional: 15, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 76, Positive conditional cache size: 18, Positive unconditional cache size: 58, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 135, independent conditional: 73, independent unconditional: 62, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 135, independent conditional: 52, independent unconditional: 83, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 135, independent conditional: 52, independent unconditional: 83, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 133, independent conditional: 51, independent unconditional: 82, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 78, Positive conditional cache size: 19, Positive unconditional cache size: 59, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 137, independent conditional: 137, 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: 153, independent: 137, independent conditional: 83, independent unconditional: 54, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 137, independent conditional: 55, independent unconditional: 82, 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: 153, independent: 137, independent conditional: 55, independent unconditional: 82, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 135, independent conditional: 53, independent unconditional: 82, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 80, Positive conditional cache size: 21, Positive unconditional cache size: 59, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 172, 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: 182, independent: 172, independent conditional: 142, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 126, independent unconditional: 46, 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: 182, independent: 172, independent conditional: 126, independent unconditional: 46, 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: 7, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 165, independent conditional: 121, independent unconditional: 44, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 89, Positive conditional cache size: 26, Positive unconditional cache size: 63, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 66 PlacesBefore, 65 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 135, independent conditional: 135, 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: 147, independent: 135, independent conditional: 111, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 135, independent conditional: 99, independent unconditional: 36, 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: 147, independent: 135, independent conditional: 99, independent unconditional: 36, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, independent: 130, independent conditional: 96, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 94, Positive conditional cache size: 29, Positive unconditional cache size: 65, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 72 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 96, independent conditional: 96, 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: 108, independent: 96, independent conditional: 72, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 96, independent conditional: 60, independent unconditional: 36, 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: 108, independent: 96, independent conditional: 60, independent unconditional: 36, 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: 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: 108, independent: 96, independent conditional: 60, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 97, Positive conditional cache size: 29, Positive unconditional cache size: 68, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 72 PlacesBefore, 70 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 121, independent conditional: 107, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 121, independent conditional: 93, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 121, independent conditional: 93, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 119, independent conditional: 91, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 107, Positive conditional cache size: 31, Positive unconditional cache size: 76, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 54, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 60, independent conditional: 48, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 48, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 66, independent: 60, independent conditional: 48, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 107, Positive conditional cache size: 31, Positive unconditional cache size: 76, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, 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_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((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_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1693, ((void *)0), P0, ((void *)0))=-2, t1693={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((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=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_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1694, ((void *)0), P1, ((void *)0))=-1, t1693={7:0}, t1694={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t1695; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)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_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 1 y = 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_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1695, ((void *)0), P2, ((void *)0))=0, t1693={7:0}, t1694={5:0}, t1695={6:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L822] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 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=2, __unbuffered_p1_EBX=0, 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=49, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 848]: 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: 850]: 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: 852]: 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, 148 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: 28.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 936 IncrementalHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 3 mSDtfsCounter, 936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=10, InterpolantAutomatonStates: 63, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 2903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:23:27,276 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...