/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:52:00,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:52:00,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:52:00,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:52:00,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:52:00,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:52:00,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:52:00,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:52:00,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:52:00,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:52:00,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:52:00,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:52:00,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:52:00,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:52:00,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:52:00,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:52:00,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:52:00,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:52:00,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:52:00,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:52:00,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:52:00,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:52:00,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:52:00,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:52:00,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:52:00,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:52:00,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:52:00,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:52:00,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:52:00,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:52:00,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:52:00,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:52:00,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:52:00,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:52:00,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:52:00,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:52:00,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:52:00,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:52:00,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:52:00,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:52:00,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:52:00,308 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:52:00,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:52:00,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:52:00,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:52:00,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:52:00,339 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:52:00,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:52:00,340 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:52:00,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:52:00,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:52:00,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:52:00,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:52:00,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:00,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:52:00,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:52:00,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:52:00,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:52:00,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:52:00,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:52:00,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:52:00,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:52:00,585 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:52:00,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-13 11:52:01,558 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:52:01,817 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:52:01,821 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-13 11:52:01,845 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1c5ade/68c986893d8c4229b145e846830b2730/FLAG33d9b8556 [2022-12-13 11:52:01,855 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1c5ade/68c986893d8c4229b145e846830b2730 [2022-12-13 11:52:01,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:52:01,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:52:01,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:01,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:52:01,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:52:01,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:01" (1/1) ... [2022-12-13 11:52:01,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51800bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:01, skipping insertion in model container [2022-12-13 11:52:01,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:01" (1/1) ... [2022-12-13 11:52:01,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:52:01,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:52:01,995 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/mix035_pso.opt_tso.opt.i[956,969] [2022-12-13 11:52:02,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:02,106 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:52:02,114 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/mix035_pso.opt_tso.opt.i[956,969] [2022-12-13 11:52:02,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:02,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:02,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:02,170 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:52:02,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02 WrapperNode [2022-12-13 11:52:02,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:02,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:02,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:52:02,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:52:02,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,227 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-12-13 11:52:02,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:02,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:52:02,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:52:02,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:52:02,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,256 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:52:02,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:52:02,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:52:02,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:52:02,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:52:02,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:52:02,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:52:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:52:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:52:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:52:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:52:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:52:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:52:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:52:02,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:52:02,346 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:52:02,486 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:52:02,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:52:02,707 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:52:02,777 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:52:02,777 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:52:02,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:02 BoogieIcfgContainer [2022-12-13 11:52:02,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:52:02,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:52:02,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:52:02,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:52:02,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:52:01" (1/3) ... [2022-12-13 11:52:02,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3510ab58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:02, skipping insertion in model container [2022-12-13 11:52:02,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02" (2/3) ... [2022-12-13 11:52:02,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3510ab58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:02, skipping insertion in model container [2022-12-13 11:52:02,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:02" (3/3) ... [2022-12-13 11:52:02,787 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-12-13 11:52:02,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:52:02,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:52:02,800 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:52:02,832 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:52:02,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 11:52:02,921 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 11:52:02,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:02,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 11:52:02,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 11:52:02,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-13 11:52:02,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:02,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 11:52:02,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-13 11:52:02,978 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 11:52:02,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:02,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 11:52:02,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 11:52:02,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-13 11:52:07,011 INFO L241 LiptonReduction]: Total number of compositions: 89 [2022-12-13 11:52:07,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:52:07,051 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;@7a975823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:52:07,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:52:07,073 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 11:52:07,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:07,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:07,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:07,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1238060157, now seen corresponding path program 1 times [2022-12-13 11:52:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:07,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868256641] [2022-12-13 11:52:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:07,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:07,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868256641] [2022-12-13 11:52:07,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868256641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:07,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:07,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944461631] [2022-12-13 11:52:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:07,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-13 11:52:07,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:07,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:07,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-13 11:52:07,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:08,338 INFO L130 PetriNetUnfolder]: 8354/12964 cut-off events. [2022-12-13 11:52:08,339 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 11:52:08,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24922 conditions, 12964 events. 8354/12964 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 93610 event pairs, 824 based on Foata normal form. 0/7428 useless extension candidates. Maximal degree in co-relation 24911. Up to 10531 conditions per place. [2022-12-13 11:52:08,368 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 29 selfloop transitions, 3 changer transitions 42/84 dead transitions. [2022-12-13 11:52:08,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 325 flow [2022-12-13 11:52:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-12-13 11:52:08,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2022-12-13 11:52:08,377 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 3 states and 109 transitions. [2022-12-13 11:52:08,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 325 flow [2022-12-13 11:52:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:08,381 INFO L231 Difference]: Finished difference. Result has 62 places, 32 transitions, 76 flow [2022-12-13 11:52:08,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=62, PETRI_TRANSITIONS=32} [2022-12-13 11:52:08,385 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2022-12-13 11:52:08,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:08,386 INFO L89 Accepts]: Start accepts. Operand has 62 places, 32 transitions, 76 flow [2022-12-13 11:52:08,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:08,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:08,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 32 transitions, 76 flow [2022-12-13 11:52:08,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 76 flow [2022-12-13 11:52:08,391 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 11:52:08,391 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:08,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 71 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:52:08,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 76 flow [2022-12-13 11:52:08,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 11:52:08,492 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:08,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 11:52:08,494 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 76 flow [2022-12-13 11:52:08,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:08,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:08,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:08,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:52:08,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -69816844, now seen corresponding path program 1 times [2022-12-13 11:52:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:08,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594260991] [2022-12-13 11:52:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:08,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594260991] [2022-12-13 11:52:08,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594260991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:08,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:08,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:08,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994306421] [2022-12-13 11:52:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:08,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:08,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:52:08,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-13 11:52:08,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:08,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:52:08,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:08,896 INFO L130 PetriNetUnfolder]: 2328/3588 cut-off events. [2022-12-13 11:52:08,896 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 11:52:08,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7273 conditions, 3588 events. 2328/3588 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18531 event pairs, 928 based on Foata normal form. 0/2732 useless extension candidates. Maximal degree in co-relation 7263. Up to 3238 conditions per place. [2022-12-13 11:52:08,911 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 33 selfloop transitions, 4 changer transitions 2/46 dead transitions. [2022-12-13 11:52:08,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 190 flow [2022-12-13 11:52:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 11:52:08,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2022-12-13 11:52:08,913 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 76 flow. Second operand 3 states and 61 transitions. [2022-12-13 11:52:08,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 190 flow [2022-12-13 11:52:08,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:08,914 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 94 flow [2022-12-13 11:52:08,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2022-12-13 11:52:08,915 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -23 predicate places. [2022-12-13 11:52:08,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:08,915 INFO L89 Accepts]: Start accepts. Operand has 42 places, 34 transitions, 94 flow [2022-12-13 11:52:08,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:08,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:08,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 94 flow [2022-12-13 11:52:08,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 94 flow [2022-12-13 11:52:08,922 INFO L130 PetriNetUnfolder]: 14/89 cut-off events. [2022-12-13 11:52:08,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:08,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 89 events. 14/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 348 event pairs, 6 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 122. Up to 29 conditions per place. [2022-12-13 11:52:08,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 94 flow [2022-12-13 11:52:08,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 11:52:08,930 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:08,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:52:08,931 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 94 flow [2022-12-13 11:52:08,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-13 11:52:08,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:08,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:08,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:52:08,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2024520170, now seen corresponding path program 1 times [2022-12-13 11:52:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:08,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400891285] [2022-12-13 11:52:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:09,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400891285] [2022-12-13 11:52:09,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400891285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:09,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:09,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360325173] [2022-12-13 11:52:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:09,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:09,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 11:52:09,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:09,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:09,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 11:52:09,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:09,230 INFO L130 PetriNetUnfolder]: 1674/2593 cut-off events. [2022-12-13 11:52:09,231 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-13 11:52:09,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5690 conditions, 2593 events. 1674/2593 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12253 event pairs, 591 based on Foata normal form. 63/2169 useless extension candidates. Maximal degree in co-relation 5679. Up to 1651 conditions per place. [2022-12-13 11:52:09,243 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 33 selfloop transitions, 3 changer transitions 1/44 dead transitions. [2022-12-13 11:52:09,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 192 flow [2022-12-13 11:52:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 11:52:09,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2022-12-13 11:52:09,244 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 94 flow. Second operand 3 states and 56 transitions. [2022-12-13 11:52:09,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 192 flow [2022-12-13 11:52:09,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:09,245 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 99 flow [2022-12-13 11:52:09,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 11:52:09,246 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -22 predicate places. [2022-12-13 11:52:09,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:09,246 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 99 flow [2022-12-13 11:52:09,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:09,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:09,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 99 flow [2022-12-13 11:52:09,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 99 flow [2022-12-13 11:52:09,251 INFO L130 PetriNetUnfolder]: 9/62 cut-off events. [2022-12-13 11:52:09,251 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-13 11:52:09,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 62 events. 9/62 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 224 event pairs, 2 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 96. Up to 21 conditions per place. [2022-12-13 11:52:09,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 99 flow [2022-12-13 11:52:09,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 11:52:09,253 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:09,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 11:52:09,254 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 99 flow [2022-12-13 11:52:09,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:09,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:09,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:09,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:52:09,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1588524446, now seen corresponding path program 1 times [2022-12-13 11:52:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:09,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896976891] [2022-12-13 11:52:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:09,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:09,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896976891] [2022-12-13 11:52:09,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896976891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:09,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:09,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429037203] [2022-12-13 11:52:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:09,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:09,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:09,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:09,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:09,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 11:52:09,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:09,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:09,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 11:52:09,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:09,608 INFO L130 PetriNetUnfolder]: 2051/3255 cut-off events. [2022-12-13 11:52:09,608 INFO L131 PetriNetUnfolder]: For 669/669 co-relation queries the response was YES. [2022-12-13 11:52:09,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7446 conditions, 3255 events. 2051/3255 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 17990 event pairs, 151 based on Foata normal form. 248/2446 useless extension candidates. Maximal degree in co-relation 7433. Up to 1783 conditions per place. [2022-12-13 11:52:09,623 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 50 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2022-12-13 11:52:09,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 309 flow [2022-12-13 11:52:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 11:52:09,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 11:52:09,625 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 99 flow. Second operand 4 states and 85 transitions. [2022-12-13 11:52:09,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 309 flow [2022-12-13 11:52:09,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:09,628 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 179 flow [2022-12-13 11:52:09,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-13 11:52:09,629 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -20 predicate places. [2022-12-13 11:52:09,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:09,629 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 179 flow [2022-12-13 11:52:09,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:09,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:09,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 179 flow [2022-12-13 11:52:09,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 179 flow [2022-12-13 11:52:09,692 INFO L130 PetriNetUnfolder]: 464/887 cut-off events. [2022-12-13 11:52:09,692 INFO L131 PetriNetUnfolder]: For 164/191 co-relation queries the response was YES. [2022-12-13 11:52:09,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 887 events. 464/887 cut-off events. For 164/191 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 5695 event pairs, 196 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 2004. Up to 712 conditions per place. [2022-12-13 11:52:09,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 179 flow [2022-12-13 11:52:09,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-13 11:52:09,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:09,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-13 11:52:09,913 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 181 flow [2022-12-13 11:52:09,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:09,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:09,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:52:09,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1768059575, now seen corresponding path program 1 times [2022-12-13 11:52:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167677230] [2022-12-13 11:52:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:10,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:10,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167677230] [2022-12-13 11:52:10,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167677230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:10,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:10,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279042375] [2022-12-13 11:52:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:10,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:10,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 11:52:10,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:10,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:10,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 11:52:10,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:10,259 INFO L130 PetriNetUnfolder]: 1173/2075 cut-off events. [2022-12-13 11:52:10,259 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-13 11:52:10,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6435 conditions, 2075 events. 1173/2075 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11962 event pairs, 42 based on Foata normal form. 216/1649 useless extension candidates. Maximal degree in co-relation 6420. Up to 1060 conditions per place. [2022-12-13 11:52:10,271 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 58 selfloop transitions, 20 changer transitions 0/85 dead transitions. [2022-12-13 11:52:10,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 477 flow [2022-12-13 11:52:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:52:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:52:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 11:52:10,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6967741935483871 [2022-12-13 11:52:10,272 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 181 flow. Second operand 5 states and 108 transitions. [2022-12-13 11:52:10,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 477 flow [2022-12-13 11:52:10,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 461 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:10,276 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 292 flow [2022-12-13 11:52:10,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2022-12-13 11:52:10,276 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -16 predicate places. [2022-12-13 11:52:10,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:10,277 INFO L89 Accepts]: Start accepts. Operand has 49 places, 52 transitions, 292 flow [2022-12-13 11:52:10,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:10,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:10,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 52 transitions, 292 flow [2022-12-13 11:52:10,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 52 transitions, 292 flow [2022-12-13 11:52:10,338 INFO L130 PetriNetUnfolder]: 302/703 cut-off events. [2022-12-13 11:52:10,339 INFO L131 PetriNetUnfolder]: For 357/429 co-relation queries the response was YES. [2022-12-13 11:52:10,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 703 events. 302/703 cut-off events. For 357/429 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 4685 event pairs, 37 based on Foata normal form. 4/361 useless extension candidates. Maximal degree in co-relation 2299. Up to 544 conditions per place. [2022-12-13 11:52:10,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 52 transitions, 292 flow [2022-12-13 11:52:10,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-13 11:52:10,491 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:10,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 11:52:10,492 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 296 flow [2022-12-13 11:52:10,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:10,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:10,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:10,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:52:10,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2144813363, now seen corresponding path program 1 times [2022-12-13 11:52:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:10,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471627071] [2022-12-13 11:52:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:10,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471627071] [2022-12-13 11:52:10,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471627071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:10,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:10,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:10,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87374335] [2022-12-13 11:52:10,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:10,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:10,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:10,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:10,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 11:52:10,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:10,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:10,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 11:52:10,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:10,859 INFO L130 PetriNetUnfolder]: 1331/2464 cut-off events. [2022-12-13 11:52:10,859 INFO L131 PetriNetUnfolder]: For 2834/3099 co-relation queries the response was YES. [2022-12-13 11:52:10,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9279 conditions, 2464 events. 1331/2464 cut-off events. For 2834/3099 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15492 event pairs, 166 based on Foata normal form. 227/2273 useless extension candidates. Maximal degree in co-relation 9262. Up to 1365 conditions per place. [2022-12-13 11:52:10,872 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 72 selfloop transitions, 9 changer transitions 16/110 dead transitions. [2022-12-13 11:52:10,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 792 flow [2022-12-13 11:52:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:52:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:52:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 11:52:10,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2022-12-13 11:52:10,874 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 296 flow. Second operand 6 states and 112 transitions. [2022-12-13 11:52:10,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 792 flow [2022-12-13 11:52:10,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 680 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-13 11:52:10,888 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 278 flow [2022-12-13 11:52:10,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-13 11:52:10,888 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -13 predicate places. [2022-12-13 11:52:10,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:10,888 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 278 flow [2022-12-13 11:52:10,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:10,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:10,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 278 flow [2022-12-13 11:52:10,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 278 flow [2022-12-13 11:52:10,955 INFO L130 PetriNetUnfolder]: 368/899 cut-off events. [2022-12-13 11:52:10,955 INFO L131 PetriNetUnfolder]: For 317/341 co-relation queries the response was YES. [2022-12-13 11:52:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 899 events. 368/899 cut-off events. For 317/341 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 6324 event pairs, 65 based on Foata normal form. 7/492 useless extension candidates. Maximal degree in co-relation 2535. Up to 676 conditions per place. [2022-12-13 11:52:10,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 278 flow [2022-12-13 11:52:10,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 11:52:10,983 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L765: Formula: (and (= v_~x~0_13 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_13} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [314] L750-->L753: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 11:52:10,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L765: Formula: (and (= v_~x~0_13 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_13} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [379] L802-->L808: Formula: (and (= v_~z~0_12 v_~__unbuffered_p2_EAX~0_16) (= v_~z~0_12 1)) InVars {} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0, ~z~0] [2022-12-13 11:52:11,419 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:52:11,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-13 11:52:11,420 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 280 flow [2022-12-13 11:52:11,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:11,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:11,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:11,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:52:11,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1925487598, now seen corresponding path program 1 times [2022-12-13 11:52:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:11,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607559214] [2022-12-13 11:52:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607559214] [2022-12-13 11:52:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607559214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:11,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:11,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:52:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827236351] [2022-12-13 11:52:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:52:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:11,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:52:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:52:11,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 11:52:11,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:11,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:11,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 11:52:11,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:11,834 INFO L130 PetriNetUnfolder]: 948/1771 cut-off events. [2022-12-13 11:52:11,834 INFO L131 PetriNetUnfolder]: For 1280/1359 co-relation queries the response was YES. [2022-12-13 11:52:11,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 1771 events. 948/1771 cut-off events. For 1280/1359 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10949 event pairs, 31 based on Foata normal form. 210/1314 useless extension candidates. Maximal degree in co-relation 6084. Up to 838 conditions per place. [2022-12-13 11:52:11,839 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 28 selfloop transitions, 29 changer transitions 10/73 dead transitions. [2022-12-13 11:52:11,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 475 flow [2022-12-13 11:52:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:52:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:52:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-13 11:52:11,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-13 11:52:11,840 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 280 flow. Second operand 6 states and 102 transitions. [2022-12-13 11:52:11,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 475 flow [2022-12-13 11:52:11,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 459 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:11,843 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 320 flow [2022-12-13 11:52:11,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 11:52:11,843 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2022-12-13 11:52:11,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:11,844 INFO L89 Accepts]: Start accepts. Operand has 56 places, 48 transitions, 320 flow [2022-12-13 11:52:11,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:11,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:11,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 320 flow [2022-12-13 11:52:11,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 320 flow [2022-12-13 11:52:11,859 INFO L130 PetriNetUnfolder]: 101/293 cut-off events. [2022-12-13 11:52:11,859 INFO L131 PetriNetUnfolder]: For 273/321 co-relation queries the response was YES. [2022-12-13 11:52:11,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 293 events. 101/293 cut-off events. For 273/321 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1584 event pairs, 1 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 1146. Up to 199 conditions per place. [2022-12-13 11:52:11,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 320 flow [2022-12-13 11:52:11,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-13 11:52:12,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:12,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L753-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:12,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L753-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P0Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:12,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L818-->L821: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:12,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [462] L818-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork1_#res#1.base_7| 0) (= |v_P2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:13,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] L818-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P2Thread1of1ForFork1_#res#1.offset_9| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:13,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L781-->L786: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:13,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:13,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L781-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_9| 0) (= |v_P1Thread1of1ForFork0_#res.base_9| 0) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [494] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_128 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_299 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_300 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_278 256) 0)) .cse1))) (and (= v_~y$r_buff1_thd0~0_127 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_128 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 0 v_~y$r_buff1_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_132 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= (ite .cse2 0 v_~y$w_buff0_used~0_300) v_~y$w_buff0_used~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_583 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~y$r_buff0_thd0~0_128 (ite .cse3 0 v_~y$r_buff0_thd0~0_129)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff1_used~0_277 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_278)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y~0_224 (ite .cse2 v_~y$w_buff0~0_195 (ite .cse4 v_~y$w_buff1~0_173 v_~y~0_225)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_195, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_195, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, ~y~0=v_~y~0_224, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_127, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:13,797 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:52:13,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1954 [2022-12-13 11:52:13,798 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 330 flow [2022-12-13 11:52:13,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:13,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:13,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:52:13,798 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash -617694430, now seen corresponding path program 1 times [2022-12-13 11:52:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758690358] [2022-12-13 11:52:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758690358] [2022-12-13 11:52:13,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758690358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:13,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:13,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981117346] [2022-12-13 11:52:13,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:13,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:13,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:13,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:13,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 11:52:13,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:13,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:13,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 11:52:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:14,115 INFO L130 PetriNetUnfolder]: 288/636 cut-off events. [2022-12-13 11:52:14,116 INFO L131 PetriNetUnfolder]: For 1791/1834 co-relation queries the response was YES. [2022-12-13 11:52:14,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 636 events. 288/636 cut-off events. For 1791/1834 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3726 event pairs, 35 based on Foata normal form. 45/509 useless extension candidates. Maximal degree in co-relation 2896. Up to 389 conditions per place. [2022-12-13 11:52:14,119 INFO L137 encePairwiseOnDemand]: 19/34 looper letters, 50 selfloop transitions, 9 changer transitions 12/78 dead transitions. [2022-12-13 11:52:14,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 675 flow [2022-12-13 11:52:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:52:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:52:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 11:52:14,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5647058823529412 [2022-12-13 11:52:14,121 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 330 flow. Second operand 5 states and 96 transitions. [2022-12-13 11:52:14,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 675 flow [2022-12-13 11:52:14,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 441 flow, removed 36 selfloop flow, removed 9 redundant places. [2022-12-13 11:52:14,129 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 242 flow [2022-12-13 11:52:14,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-13 11:52:14,130 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-13 11:52:14,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:14,130 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 242 flow [2022-12-13 11:52:14,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:14,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:14,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 242 flow [2022-12-13 11:52:14,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 242 flow [2022-12-13 11:52:14,161 INFO L130 PetriNetUnfolder]: 104/301 cut-off events. [2022-12-13 11:52:14,161 INFO L131 PetriNetUnfolder]: For 123/125 co-relation queries the response was YES. [2022-12-13 11:52:14,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 301 events. 104/301 cut-off events. For 123/125 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 1890 event pairs, 1 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 706. Up to 144 conditions per place. [2022-12-13 11:52:14,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 242 flow [2022-12-13 11:52:14,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-13 11:52:14,165 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:14,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 11:52:14,165 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 242 flow [2022-12-13 11:52:14,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:14,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:14,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:14,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:52:14,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2098118437, now seen corresponding path program 1 times [2022-12-13 11:52:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:14,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895166691] [2022-12-13 11:52:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:14,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895166691] [2022-12-13 11:52:14,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895166691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:14,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:14,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634147257] [2022-12-13 11:52:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:14,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:14,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-13 11:52:14,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:14,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:14,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-13 11:52:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:14,461 INFO L130 PetriNetUnfolder]: 331/763 cut-off events. [2022-12-13 11:52:14,461 INFO L131 PetriNetUnfolder]: For 1101/1126 co-relation queries the response was YES. [2022-12-13 11:52:14,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 763 events. 331/763 cut-off events. For 1101/1126 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 4896 event pairs, 70 based on Foata normal form. 37/589 useless extension candidates. Maximal degree in co-relation 2401. Up to 367 conditions per place. [2022-12-13 11:52:14,464 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 32 selfloop transitions, 3 changer transitions 36/78 dead transitions. [2022-12-13 11:52:14,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 78 transitions, 506 flow [2022-12-13 11:52:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:52:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:52:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-13 11:52:14,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2022-12-13 11:52:14,465 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 242 flow. Second operand 6 states and 97 transitions. [2022-12-13 11:52:14,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 78 transitions, 506 flow [2022-12-13 11:52:14,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:52:14,467 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 212 flow [2022-12-13 11:52:14,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2022-12-13 11:52:14,467 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -13 predicate places. [2022-12-13 11:52:14,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:14,468 INFO L89 Accepts]: Start accepts. Operand has 52 places, 39 transitions, 212 flow [2022-12-13 11:52:14,468 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:14,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:14,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 39 transitions, 212 flow [2022-12-13 11:52:14,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 212 flow [2022-12-13 11:52:14,486 INFO L130 PetriNetUnfolder]: 72/181 cut-off events. [2022-12-13 11:52:14,486 INFO L131 PetriNetUnfolder]: For 198/211 co-relation queries the response was YES. [2022-12-13 11:52:14,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 181 events. 72/181 cut-off events. For 198/211 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 868 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 531. Up to 87 conditions per place. [2022-12-13 11:52:14,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 212 flow [2022-12-13 11:52:14,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 11:52:14,685 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:52:14,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 11:52:14,686 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 206 flow [2022-12-13 11:52:14,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:14,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:14,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:14,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:52:14,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1658656763, now seen corresponding path program 1 times [2022-12-13 11:52:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:14,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298624975] [2022-12-13 11:52:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:15,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298624975] [2022-12-13 11:52:15,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298624975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:15,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:15,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085608724] [2022-12-13 11:52:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:15,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:52:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:15,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:52:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:52:15,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 11:52:15,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:15,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:15,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 11:52:15,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:15,212 INFO L130 PetriNetUnfolder]: 121/293 cut-off events. [2022-12-13 11:52:15,213 INFO L131 PetriNetUnfolder]: For 646/666 co-relation queries the response was YES. [2022-12-13 11:52:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 293 events. 121/293 cut-off events. For 646/666 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 1785 event pairs, 2 based on Foata normal form. 38/216 useless extension candidates. Maximal degree in co-relation 1024. Up to 120 conditions per place. [2022-12-13 11:52:15,214 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 23 selfloop transitions, 12 changer transitions 13/54 dead transitions. [2022-12-13 11:52:15,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 386 flow [2022-12-13 11:52:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:52:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:52:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-13 11:52:15,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-13 11:52:15,215 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 206 flow. Second operand 7 states and 81 transitions. [2022-12-13 11:52:15,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 386 flow [2022-12-13 11:52:15,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 340 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-13 11:52:15,218 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 200 flow [2022-12-13 11:52:15,218 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 11:52:15,219 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-13 11:52:15,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:15,219 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 200 flow [2022-12-13 11:52:15,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:15,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:15,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 200 flow [2022-12-13 11:52:15,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 200 flow [2022-12-13 11:52:15,241 INFO L130 PetriNetUnfolder]: 72/176 cut-off events. [2022-12-13 11:52:15,241 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 11:52:15,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 176 events. 72/176 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 951 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 573. Up to 84 conditions per place. [2022-12-13 11:52:15,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 200 flow [2022-12-13 11:52:15,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 11:52:17,197 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:52:17,211 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1992 [2022-12-13 11:52:17,211 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 237 flow [2022-12-13 11:52:17,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:17,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:17,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:17,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:52:17,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1216826471, now seen corresponding path program 1 times [2022-12-13 11:52:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:17,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789061974] [2022-12-13 11:52:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:52:17,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:52:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:52:17,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:52:17,297 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:52:17,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:52:17,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:52:17,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:52:17,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:52:17,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:52:17,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:52:17,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:52:17,304 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:17,310 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:52:17,310 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:52:17,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:52:17 BasicIcfg [2022-12-13 11:52:17,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:52:17,368 INFO L158 Benchmark]: Toolchain (without parser) took 15510.37ms. Allocated memory was 177.2MB in the beginning and 738.2MB in the end (delta: 561.0MB). Free memory was 151.8MB in the beginning and 309.6MB in the end (delta: -157.8MB). Peak memory consumption was 404.8MB. Max. memory is 8.0GB. [2022-12-13 11:52:17,368 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:52:17,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.87ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 125.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:52:17,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.04ms. Allocated memory is still 177.2MB. Free memory was 125.6MB in the beginning and 123.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:52:17,369 INFO L158 Benchmark]: Boogie Preprocessor took 29.21ms. Allocated memory is still 177.2MB. Free memory was 123.0MB in the beginning and 121.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:52:17,369 INFO L158 Benchmark]: RCFGBuilder took 506.94ms. Allocated memory is still 177.2MB. Free memory was 121.4MB in the beginning and 91.5MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 11:52:17,369 INFO L158 Benchmark]: TraceAbstraction took 14587.53ms. Allocated memory was 177.2MB in the beginning and 738.2MB in the end (delta: 561.0MB). Free memory was 90.5MB in the beginning and 309.6MB in the end (delta: -219.1MB). Peak memory consumption was 342.9MB. Max. memory is 8.0GB. [2022-12-13 11:52:17,370 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.87ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 125.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.04ms. Allocated memory is still 177.2MB. Free memory was 125.6MB in the beginning and 123.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.21ms. Allocated memory is still 177.2MB. Free memory was 123.0MB in the beginning and 121.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 506.94ms. Allocated memory is still 177.2MB. Free memory was 121.4MB in the beginning and 91.5MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 14587.53ms. Allocated memory was 177.2MB in the beginning and 738.2MB in the end (delta: 561.0MB). Free memory was 90.5MB in the beginning and 309.6MB in the end (delta: -219.1MB). Peak memory consumption was 342.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 116 PlacesBefore, 65 PlacesAfterwards, 108 TransitionsBefore, 56 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 3818, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 0, independent unconditional: 3818, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 0, independent unconditional: 3818, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3939, independent: 3818, independent conditional: 0, independent unconditional: 3818, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1962, independent: 1919, independent conditional: 0, independent unconditional: 1919, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1962, independent: 1884, independent conditional: 0, independent unconditional: 1884, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3939, independent: 1899, independent conditional: 0, independent unconditional: 1899, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 1962, unknown conditional: 0, unknown unconditional: 1962] , Statistics on independence cache: Total cache size (in pairs): 4171, Positive cache size: 4128, Positive conditional cache size: 0, Positive unconditional cache size: 4128, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 289, independent conditional: 289, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 323, independent: 289, independent conditional: 22, independent unconditional: 267, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 323, independent: 289, independent conditional: 22, independent unconditional: 267, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 323, independent: 289, independent conditional: 22, independent unconditional: 267, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 252, independent: 229, independent conditional: 19, independent unconditional: 210, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 252, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 67, dependent conditional: 11, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 323, independent: 60, independent conditional: 3, independent unconditional: 57, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 252, unknown conditional: 21, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 229, Positive conditional cache size: 19, Positive unconditional cache size: 210, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 158, independent conditional: 158, 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: 175, independent: 158, independent conditional: 8, independent unconditional: 150, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 158, independent conditional: 0, independent unconditional: 158, 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: 175, independent: 158, independent conditional: 0, independent unconditional: 158, 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: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 243, Positive conditional cache size: 19, Positive unconditional cache size: 224, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, 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, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 159, independent conditional: 159, 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: 177, independent: 159, independent conditional: 8, independent unconditional: 151, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 159, independent conditional: 0, independent unconditional: 159, 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: 177, independent: 159, independent conditional: 0, independent unconditional: 159, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 253, Positive conditional cache size: 19, Positive unconditional cache size: 234, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, 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.2s, 45 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 178, independent conditional: 53, independent unconditional: 125, dependent: 32, dependent conditional: 10, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 178, independent conditional: 24, independent unconditional: 154, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 178, independent conditional: 24, independent unconditional: 154, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 172, independent conditional: 24, independent unconditional: 148, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 267, Positive conditional cache size: 19, Positive unconditional cache size: 248, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 385, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 385, independent: 347, independent conditional: 195, independent unconditional: 152, dependent: 38, dependent conditional: 10, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 387, independent: 347, independent conditional: 152, independent unconditional: 195, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 387, independent: 347, independent conditional: 152, independent unconditional: 195, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 387, independent: 343, independent conditional: 148, independent unconditional: 195, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 280, Positive conditional cache size: 23, Positive unconditional cache size: 257, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 52 PlacesBefore, 51 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 656, independent: 596, independent conditional: 596, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 656, independent: 596, independent conditional: 330, independent unconditional: 266, dependent: 60, dependent conditional: 6, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 659, independent: 596, independent conditional: 231, independent unconditional: 365, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 659, independent: 596, independent conditional: 231, independent unconditional: 365, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 5, independent unconditional: 9, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 659, independent: 582, independent conditional: 226, independent unconditional: 356, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 350, Positive conditional cache size: 29, Positive unconditional cache size: 321, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 108, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 53 PlacesBefore, 50 PlacesAfterwards, 48 TransitionsBefore, 42 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, independent: 243, independent conditional: 243, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 275, independent: 243, independent conditional: 159, independent unconditional: 84, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 275, independent: 243, independent conditional: 151, independent unconditional: 92, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 275, independent: 243, independent conditional: 151, independent unconditional: 92, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, independent unconditional: 0, 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: 33, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 275, independent: 213, independent conditional: 121, independent unconditional: 92, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 33, unknown conditional: 30, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 406, Positive conditional cache size: 59, Positive unconditional cache size: 347, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 73, independent conditional: 73, 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: 87, independent: 73, independent conditional: 48, independent unconditional: 25, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 73, independent conditional: 42, independent unconditional: 31, 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: 87, independent: 73, independent conditional: 42, independent unconditional: 31, 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: 87, independent: 73, independent conditional: 42, independent unconditional: 31, 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): 435, Positive cache size: 406, Positive conditional cache size: 59, Positive unconditional cache size: 347, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 49 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 251, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 251, independent: 213, independent conditional: 129, independent unconditional: 84, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 251, independent: 213, independent conditional: 129, independent unconditional: 84, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 251, independent: 213, independent conditional: 129, independent unconditional: 84, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 251, independent: 206, independent conditional: 126, independent unconditional: 80, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 453, Positive conditional cache size: 63, Positive unconditional cache size: 390, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 45 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 111, independent conditional: 108, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 111, independent conditional: 108, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 111, independent conditional: 108, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 111, independent conditional: 108, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 599, Positive cache size: 570, Positive conditional cache size: 63, Positive unconditional cache size: 507, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 a = 1 [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L844] RET 3 assume_abort_if_not(main$tmp_guard0) [L846] 3 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 3 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 3 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L853] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 827 IncrementalHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 13 mSDtfsCounter, 827 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:52:17,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...