/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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:35:23,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:35:23,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:35:23,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:35:23,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:35:23,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:35:23,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:35:23,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:35:23,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:35:23,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:35:23,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:35:23,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:35:23,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:35:23,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:35:23,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:35:23,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:35:23,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:35:23,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:35:23,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:35:23,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:35:23,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:35:23,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:35:23,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:35:23,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:35:23,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:35:23,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:35:23,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:35:23,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:35:23,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:35:23,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:35:23,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:35:23,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:35:23,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:35:23,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:35:23,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:35:23,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:35:23,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:35:23,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:35:23,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:35:23,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:35:23,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:35:23,276 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-06 06:35:23,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:35:23,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:35:23,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:35:23,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:35:23,319 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:35:23,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:35:23,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:35:23,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:35:23,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:35:23,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:35:23,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:35:23,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:35:23,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:35:23,321 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:35:23,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:35:23,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:35:23,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:35:23,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:35:23,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:35:23,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:35:23,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:35:23,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:35:23,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:35:23,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:35:23,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:35:23,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:35:23,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:35:23,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:35:23,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:35:23,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:35:23,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:35:23,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:35:23,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:35:23,634 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:35:23,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:35:24,821 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:35:25,127 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:35:25,128 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:35:25,141 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ee4f82b/e0df4a7cc8784979b64ff63410de1ba3/FLAGb29a6ef28 [2022-12-06 06:35:25,156 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ee4f82b/e0df4a7cc8784979b64ff63410de1ba3 [2022-12-06 06:35:25,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:35:25,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:35:25,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:35:25,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:35:25,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:35:25,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19fe9c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25, skipping insertion in model container [2022-12-06 06:35:25,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:35:25,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:35:25,370 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-06 06:35:25,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:35:25,639 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:35:25,657 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-06 06:35:25,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:25,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:25,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:35:25,759 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:35:25,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25 WrapperNode [2022-12-06 06:35:25,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:35:25,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:35:25,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:35:25,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:35:25,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,806 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 06:35:25,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:35:25,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:35:25,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:35:25,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:35:25,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:35:25,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:35:25,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:35:25,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:35:25,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (1/1) ... [2022-12-06 06:35:25,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:35:25,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:35:25,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:35:25,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:35:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:35:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:35:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:35:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:35:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:35:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:35:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:35:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:35:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:35:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:35:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:35:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:35:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:35:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:35:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:35:25,936 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:35:26,109 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:35:26,111 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:35:26,476 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:35:26,641 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:35:26,642 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:35:26,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:35:26 BoogieIcfgContainer [2022-12-06 06:35:26,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:35:26,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:35:26,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:35:26,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:35:26,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:35:25" (1/3) ... [2022-12-06 06:35:26,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23516b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:35:26, skipping insertion in model container [2022-12-06 06:35:26,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:25" (2/3) ... [2022-12-06 06:35:26,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23516b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:35:26, skipping insertion in model container [2022-12-06 06:35:26,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:35:26" (3/3) ... [2022-12-06 06:35:26,652 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:35:26,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:35:26,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:35:26,670 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:35:26,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:35:26,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:35:26,864 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:35:26,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:26,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:35:26,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:35:26,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 06:35:26,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:26,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:35:26,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 06:35:26,959 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:35:26,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:26,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:35:26,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:35:26,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 06:35:31,960 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:35:31,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:35:31,980 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;@7aa708da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:35:31,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:35:31,982 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:35:31,983 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:31,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:31,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:35:31,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 532114, now seen corresponding path program 1 times [2022-12-06 06:35:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:31,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543295565] [2022-12-06 06:35:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543295565] [2022-12-06 06:35:32,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543295565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:32,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:35:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981299243] [2022-12-06 06:35:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:35:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:32,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:35:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:35:32,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:35:32,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:32,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:32,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:35:32,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:32,807 INFO L130 PetriNetUnfolder]: 1290/1991 cut-off events. [2022-12-06 06:35:32,808 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:35:32,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 1991 events. 1290/1991 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9798 event pairs, 359 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 3938. Up to 1549 conditions per place. [2022-12-06 06:35:32,823 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-06 06:35:32,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2022-12-06 06:35:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:35:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:35:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:35:32,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 06:35:32,836 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:35:32,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2022-12-06 06:35:32,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:35:32,840 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-06 06:35:32,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 06:35:32,845 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:35:32,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:32,846 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-06 06:35:32,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:32,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:32,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-06 06:35:32,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 06:35:32,855 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:35:32,855 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:32,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:35:32,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 06:35:32,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 06:35:33,224 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:33,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-06 06:35:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:35:33,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:33,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:33,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:33,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:35:33,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:33,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 965953663, now seen corresponding path program 1 times [2022-12-06 06:35:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:33,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140886772] [2022-12-06 06:35:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:33,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140886772] [2022-12-06 06:35:33,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140886772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:33,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:33,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679260925] [2022-12-06 06:35:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:33,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:33,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:35:33,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:33,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:33,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:35:33,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:34,159 INFO L130 PetriNetUnfolder]: 807/1218 cut-off events. [2022-12-06 06:35:34,159 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-06 06:35:34,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 1218 events. 807/1218 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4929 event pairs, 315 based on Foata normal form. 40/1257 useless extension candidates. Maximal degree in co-relation 2580. Up to 773 conditions per place. [2022-12-06 06:35:34,167 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 06:35:34,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 130 flow [2022-12-06 06:35:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:35:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:35:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:35:34,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:35:34,169 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:35:34,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 130 flow [2022-12-06 06:35:34,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:34,171 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 06:35:34,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 06:35:34,172 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2022-12-06 06:35:34,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:34,172 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:35:34,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:34,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:34,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:35:34,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:35:34,179 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:35:34,179 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:34,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 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-06 06:35:34,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:35:34,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:35:34,205 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:34,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 06:35:34,207 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 06:35:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:34,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:34,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:35:34,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 571371497, now seen corresponding path program 1 times [2022-12-06 06:35:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:34,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143966162] [2022-12-06 06:35:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:34,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143966162] [2022-12-06 06:35:34,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143966162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:34,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:34,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461295799] [2022-12-06 06:35:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:34,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:34,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:35:34,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:34,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:34,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:35:34,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:35,120 INFO L130 PetriNetUnfolder]: 778/1176 cut-off events. [2022-12-06 06:35:35,120 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-12-06 06:35:35,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 1176 events. 778/1176 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5186 event pairs, 122 based on Foata normal form. 12/1187 useless extension candidates. Maximal degree in co-relation 2563. Up to 1013 conditions per place. [2022-12-06 06:35:35,127 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 06:35:35,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 145 flow [2022-12-06 06:35:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:35:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:35:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:35:35,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:35:35,129 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:35:35,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 145 flow [2022-12-06 06:35:35,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:35,130 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2022-12-06 06:35:35,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:35:35,131 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places. [2022-12-06 06:35:35,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:35,131 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 60 flow [2022-12-06 06:35:35,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:35,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:35,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2022-12-06 06:35:35,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2022-12-06 06:35:35,137 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:35:35,138 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:35:35,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 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-06 06:35:35,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2022-12-06 06:35:35,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:35:35,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:35,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:35:35,141 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2022-12-06 06:35:35,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:35,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:35,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:35,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:35:35,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash 530511493, now seen corresponding path program 1 times [2022-12-06 06:35:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:35,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224736607] [2022-12-06 06:35:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:35,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224736607] [2022-12-06 06:35:35,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224736607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:35,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:35,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345726599] [2022-12-06 06:35:35,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:35,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:35,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:35:35,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:35,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:35,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:35:35,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:35,611 INFO L130 PetriNetUnfolder]: 997/1581 cut-off events. [2022-12-06 06:35:35,612 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-12-06 06:35:35,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1581 events. 997/1581 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7971 event pairs, 247 based on Foata normal form. 45/1624 useless extension candidates. Maximal degree in co-relation 3484. Up to 606 conditions per place. [2022-12-06 06:35:35,650 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 37 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2022-12-06 06:35:35,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 211 flow [2022-12-06 06:35:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:35:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:35:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:35:35,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:35:35,652 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:35:35,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 211 flow [2022-12-06 06:35:35,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:35,654 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 70 flow [2022-12-06 06:35:35,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-06 06:35:35,655 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:35:35,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:35,655 INFO L89 Accepts]: Start accepts. Operand has 35 places, 21 transitions, 70 flow [2022-12-06 06:35:35,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:35,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:35,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 70 flow [2022-12-06 06:35:35,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 70 flow [2022-12-06 06:35:35,661 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:35:35,661 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 06:35:35,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 21 events. 0/21 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 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-06 06:35:35,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 70 flow [2022-12-06 06:35:35,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 06:35:35,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:35,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 06:35:35,831 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 68 flow [2022-12-06 06:35:35,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:35,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:35,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:35,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:35:35,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1494618807, now seen corresponding path program 1 times [2022-12-06 06:35:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:35,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553208563] [2022-12-06 06:35:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:36,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553208563] [2022-12-06 06:35:36,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553208563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:36,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:36,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787999551] [2022-12-06 06:35:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:36,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:36,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:36,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:35:36,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 68 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:36,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:36,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:35:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:36,549 INFO L130 PetriNetUnfolder]: 898/1389 cut-off events. [2022-12-06 06:35:36,550 INFO L131 PetriNetUnfolder]: For 791/791 co-relation queries the response was YES. [2022-12-06 06:35:36,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 1389 events. 898/1389 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6176 event pairs, 83 based on Foata normal form. 39/1428 useless extension candidates. Maximal degree in co-relation 3339. Up to 674 conditions per place. [2022-12-06 06:35:36,557 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 37 selfloop transitions, 6 changer transitions 11/54 dead transitions. [2022-12-06 06:35:36,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 263 flow [2022-12-06 06:35:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 06:35:36,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 06:35:36,561 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 68 flow. Second operand 5 states and 56 transitions. [2022-12-06 06:35:36,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 263 flow [2022-12-06 06:35:36,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 247 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:35:36,572 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 92 flow [2022-12-06 06:35:36,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 06:35:36,575 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-06 06:35:36,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:36,575 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 92 flow [2022-12-06 06:35:36,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:36,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:36,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 92 flow [2022-12-06 06:35:36,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 92 flow [2022-12-06 06:35:36,593 INFO L130 PetriNetUnfolder]: 11/66 cut-off events. [2022-12-06 06:35:36,594 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 06:35:36,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 11/66 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 237 event pairs, 4 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 129. Up to 24 conditions per place. [2022-12-06 06:35:36,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 92 flow [2022-12-06 06:35:36,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 06:35:36,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] $Ultimate##0-->L756: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg#1.base_42| |v_P0Thread1of1ForFork2_~arg#1.base_42|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_50| 0)) (= v_~y$w_buff0_used~0_586 1) (= v_~y$r_buff0_thd1~0_182 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_50| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_50|) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_42| |v_P0Thread1of1ForFork2_~arg#1.offset_42|) (= v_~y$r_buff0_thd0~0_256 v_~y$r_buff1_thd0~0_258) (= v_~y$r_buff0_thd2~0_110 v_~y$r_buff1_thd2~0_115) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_50| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_531 256) 0)) (not (= (mod v_~y$w_buff0_used~0_586 256) 0)))) 1 0)) (= v_~x~0_37 1) (= v_~y$w_buff1~0_336 v_~y$w_buff0~0_381) (= v_~y$r_buff0_thd1~0_183 v_~y$r_buff1_thd1~0_136) (= 2 v_~y$w_buff0~0_380) (= v_~y$r_buff0_thd3~0_259 v_~y$r_buff1_thd3~0_265) (= v_~y$w_buff0_used~0_587 v_~y$w_buff1_used~0_531)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_587, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_42|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_259, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_256, ~y$w_buff0~0=v_~y$w_buff0~0_381, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_183, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_42|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_586, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_42|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_50|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_42|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_42|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_42|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_115, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_265, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_50|, ~y$w_buff1~0=v_~y$w_buff1~0_336, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_259, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_256, ~y$w_buff0~0=v_~y$w_buff0~0_380, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_182, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_258, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_531} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [513] $Ultimate##0-->L776: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_519 1) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|) (= v_~x~0_39 v_~__unbuffered_p1_EAX~0_65)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~x~0=v_~x~0_39} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~y~0=v_~y~0_519, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~y~0] [2022-12-06 06:35:36,933 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:35:36,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-06 06:35:36,934 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 98 flow [2022-12-06 06:35:36,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:36,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:36,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:36,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:35:36,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1918988787, now seen corresponding path program 2 times [2022-12-06 06:35:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:36,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223927440] [2022-12-06 06:35:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:38,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223927440] [2022-12-06 06:35:38,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223927440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:38,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:38,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:35:38,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054730778] [2022-12-06 06:35:38,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:38,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:35:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:35:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:35:38,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:35:38,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 98 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:38,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:38,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:35:38,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:38,722 INFO L130 PetriNetUnfolder]: 665/1056 cut-off events. [2022-12-06 06:35:38,722 INFO L131 PetriNetUnfolder]: For 905/905 co-relation queries the response was YES. [2022-12-06 06:35:38,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1056 events. 665/1056 cut-off events. For 905/905 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4634 event pairs, 120 based on Foata normal form. 36/1092 useless extension candidates. Maximal degree in co-relation 2752. Up to 624 conditions per place. [2022-12-06 06:35:38,728 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-06 06:35:38,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 254 flow [2022-12-06 06:35:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:35:38,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 06:35:38,730 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 98 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:35:38,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 254 flow [2022-12-06 06:35:38,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 240 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 06:35:38,732 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 136 flow [2022-12-06 06:35:38,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 06:35:38,733 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-06 06:35:38,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:38,733 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 136 flow [2022-12-06 06:35:38,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:38,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:38,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 136 flow [2022-12-06 06:35:38,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 136 flow [2022-12-06 06:35:38,751 INFO L130 PetriNetUnfolder]: 28/120 cut-off events. [2022-12-06 06:35:38,751 INFO L131 PetriNetUnfolder]: For 78/84 co-relation queries the response was YES. [2022-12-06 06:35:38,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 120 events. 28/120 cut-off events. For 78/84 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 560 event pairs, 9 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 287. Up to 39 conditions per place. [2022-12-06 06:35:38,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 136 flow [2022-12-06 06:35:38,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 06:35:38,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:38,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:35:38,783 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 138 flow [2022-12-06 06:35:38,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:38,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:38,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:38,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:35:38,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:38,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash 918917224, now seen corresponding path program 1 times [2022-12-06 06:35:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:38,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806686417] [2022-12-06 06:35:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:38,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:40,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806686417] [2022-12-06 06:35:40,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806686417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:40,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:40,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:35:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304933813] [2022-12-06 06:35:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:40,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:35:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:40,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:35:40,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:35:40,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:35:40,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 138 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:40,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:40,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:35:40,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:40,706 INFO L130 PetriNetUnfolder]: 900/1439 cut-off events. [2022-12-06 06:35:40,706 INFO L131 PetriNetUnfolder]: For 1463/1463 co-relation queries the response was YES. [2022-12-06 06:35:40,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1439 events. 900/1439 cut-off events. For 1463/1463 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6650 event pairs, 144 based on Foata normal form. 12/1451 useless extension candidates. Maximal degree in co-relation 4228. Up to 922 conditions per place. [2022-12-06 06:35:40,714 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 60 selfloop transitions, 28 changer transitions 4/92 dead transitions. [2022-12-06 06:35:40,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 92 transitions, 592 flow [2022-12-06 06:35:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:35:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:35:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-06 06:35:40,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45108695652173914 [2022-12-06 06:35:40,717 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 138 flow. Second operand 8 states and 83 transitions. [2022-12-06 06:35:40,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 92 transitions, 592 flow [2022-12-06 06:35:40,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 92 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:40,720 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 378 flow [2022-12-06 06:35:40,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2022-12-06 06:35:40,721 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 06:35:40,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:40,721 INFO L89 Accepts]: Start accepts. Operand has 48 places, 51 transitions, 378 flow [2022-12-06 06:35:40,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:40,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:40,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 51 transitions, 378 flow [2022-12-06 06:35:40,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 378 flow [2022-12-06 06:35:40,757 INFO L130 PetriNetUnfolder]: 83/243 cut-off events. [2022-12-06 06:35:40,757 INFO L131 PetriNetUnfolder]: For 495/530 co-relation queries the response was YES. [2022-12-06 06:35:40,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 243 events. 83/243 cut-off events. For 495/530 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1345 event pairs, 7 based on Foata normal form. 3/237 useless extension candidates. Maximal degree in co-relation 856. Up to 100 conditions per place. [2022-12-06 06:35:40,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 51 transitions, 378 flow [2022-12-06 06:35:40,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 06:35:40,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:40,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 06:35:40,806 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 382 flow [2022-12-06 06:35:40,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:40,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:40,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:40,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:35:40,807 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:40,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:40,807 INFO L85 PathProgramCache]: Analyzing trace with hash 918917007, now seen corresponding path program 1 times [2022-12-06 06:35:40,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:40,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882635561] [2022-12-06 06:35:40,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:41,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:41,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882635561] [2022-12-06 06:35:41,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882635561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:41,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:41,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106699889] [2022-12-06 06:35:41,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:41,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:41,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:41,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:35:41,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 382 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:41,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:41,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:35:41,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:41,291 INFO L130 PetriNetUnfolder]: 657/1148 cut-off events. [2022-12-06 06:35:41,291 INFO L131 PetriNetUnfolder]: For 3686/3686 co-relation queries the response was YES. [2022-12-06 06:35:41,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 1148 events. 657/1148 cut-off events. For 3686/3686 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5947 event pairs, 94 based on Foata normal form. 122/1270 useless extension candidates. Maximal degree in co-relation 4121. Up to 736 conditions per place. [2022-12-06 06:35:41,300 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 72 selfloop transitions, 4 changer transitions 57/134 dead transitions. [2022-12-06 06:35:41,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 134 transitions, 1261 flow [2022-12-06 06:35:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 06:35:41,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:35:41,302 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 382 flow. Second operand 5 states and 75 transitions. [2022-12-06 06:35:41,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 134 transitions, 1261 flow [2022-12-06 06:35:41,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 134 transitions, 1204 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-06 06:35:41,309 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 386 flow [2022-12-06 06:35:41,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-06 06:35:41,310 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-12-06 06:35:41,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:41,310 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 386 flow [2022-12-06 06:35:41,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:41,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:41,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 386 flow [2022-12-06 06:35:41,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 51 transitions, 386 flow [2022-12-06 06:35:41,356 INFO L130 PetriNetUnfolder]: 172/374 cut-off events. [2022-12-06 06:35:41,357 INFO L131 PetriNetUnfolder]: For 1171/1202 co-relation queries the response was YES. [2022-12-06 06:35:41,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 374 events. 172/374 cut-off events. For 1171/1202 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2052 event pairs, 47 based on Foata normal form. 4/358 useless extension candidates. Maximal degree in co-relation 1439. Up to 182 conditions per place. [2022-12-06 06:35:41,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 51 transitions, 386 flow [2022-12-06 06:35:41,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 06:35:41,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L776: Formula: (and (= v_~y$w_buff0_used~0_629 v_~y$w_buff1_used~0_569) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~y$w_buff1~0_360 v_~y$w_buff0~0_409) (= v_~y$r_buff0_thd1~0_201 v_~y$r_buff1_thd1~0_150) (= v_~x~0_43 v_~__unbuffered_p1_EAX~0_67) (= v_~x~0_43 1) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= v_~y$w_buff0_used~0_628 1) (= 2 v_~y$w_buff0~0_408) (= v_~y~0_525 1) (= v_~y$r_buff0_thd0~0_268 v_~y$r_buff1_thd0~0_270) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~y$r_buff0_thd2~0_122 v_~y$r_buff1_thd2~0_127) (= v_~y$r_buff0_thd1~0_200 1) (= v_~y$r_buff0_thd3~0_279 v_~y$r_buff1_thd3~0_285) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_569 256) 0)) (not (= (mod v_~y$w_buff0_used~0_628 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_629, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, ~y$w_buff0~0=v_~y$w_buff0~0_409, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_201, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_628, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_150, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_285, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_408, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_200, ~y~0=v_~y~0_525, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_127, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~y$w_buff1~0=v_~y$w_buff1~0_360, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~x~0=v_~x~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_270, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_569} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [387] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_26 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_204 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_189 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_204) v_~y$w_buff0_used~0_203) (= v_~y$w_buff1_used~0_188 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_189)) (= v_~y$r_buff0_thd1~0_30 (ite .cse1 0 v_~y$r_buff0_thd1~0_31)) (= v_~y~0_161 (ite .cse0 v_~y$w_buff0~0_97 (ite .cse2 v_~y$w_buff1~0_92 v_~y~0_162))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse4 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_26) v_~y$r_buff1_thd1~0_25)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_162, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_161, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:35:41,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [514] $Ultimate##0-->L763: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_624 256) 0)) (.cse2 (not (= (mod v_~y$r_buff0_thd1~0_196 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_622 256) 0)))) (and (= v_~y$r_buff0_thd1~0_194 (ite .cse0 0 1)) (= (ite .cse1 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_52|) (= v_~x~0_41 1) (= v_~y~0_521 v_~y$w_buff0~0_404) (= v_~y$r_buff0_thd2~0_120 v_~y$r_buff1_thd2~0_125) (= v_~y$w_buff1~0_358 v_~y$w_buff0~0_405) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_52| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_52|) (= v_~y$w_buff0_used~0_622 0) (= v_~y$w_buff1_used~0_565 (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~y$w_buff0_used~0_624)) (= v_~y$r_buff0_thd0~0_266 v_~y$r_buff1_thd0~0_268) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_44| |v_P0Thread1of1ForFork2_~arg#1.offset_44|) (= 2 v_~y$w_buff0~0_404) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_565 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd1~0_194 256) 0)) .cse0)) 0 v_~y$r_buff0_thd1~0_196) v_~y$r_buff1_thd1~0_146) (= v_~y$r_buff0_thd3~0_277 v_~y$r_buff1_thd3~0_283) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_52| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_44| |v_P0Thread1of1ForFork2_~arg#1.base_44|))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_624, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_44|, ~y$w_buff0~0=v_~y$w_buff0~0_405, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_266, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_196, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_120, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_44|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_622, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_44|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_52|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_44|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_44|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_125, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_146, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_283, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_52|, ~y$w_buff1~0=v_~y$w_buff1~0_358, ~y$w_buff0~0=v_~y$w_buff0~0_404, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_266, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_194, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_120, ~y~0=v_~y~0_521, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_565} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [519] $Ultimate##0-->L776: Formula: (and (= v_~y~0_542 1) (= v_~x~0_51 v_~__unbuffered_p1_EAX~0_75) (= |v_P1Thread1of1ForFork0_#in~arg.offset_27| v_P1Thread1of1ForFork0_~arg.offset_27) (= v_P1Thread1of1ForFork0_~arg.base_27 |v_P1Thread1of1ForFork0_#in~arg.base_27|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~x~0=v_~x~0_51} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_75, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_27, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~y~0=v_~y~0_542, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~y~0] [2022-12-06 06:35:41,885 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:35:41,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-06 06:35:41,886 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 394 flow [2022-12-06 06:35:41,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:41,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:41,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:41,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:35:41,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 250013293, now seen corresponding path program 1 times [2022-12-06 06:35:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:41,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20166833] [2022-12-06 06:35:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20166833] [2022-12-06 06:35:42,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20166833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:42,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:42,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:35:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269659225] [2022-12-06 06:35:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:42,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:42,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:35:42,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:42,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:42,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:35:42,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:42,341 INFO L130 PetriNetUnfolder]: 303/581 cut-off events. [2022-12-06 06:35:42,341 INFO L131 PetriNetUnfolder]: For 2438/2438 co-relation queries the response was YES. [2022-12-06 06:35:42,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 581 events. 303/581 cut-off events. For 2438/2438 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2747 event pairs, 26 based on Foata normal form. 73/654 useless extension candidates. Maximal degree in co-relation 2492. Up to 258 conditions per place. [2022-12-06 06:35:42,345 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 70 selfloop transitions, 7 changer transitions 48/125 dead transitions. [2022-12-06 06:35:42,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 125 transitions, 1155 flow [2022-12-06 06:35:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:35:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:35:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 06:35:42,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2022-12-06 06:35:42,347 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 394 flow. Second operand 6 states and 73 transitions. [2022-12-06 06:35:42,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 125 transitions, 1155 flow [2022-12-06 06:35:42,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 1141 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:42,355 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 355 flow [2022-12-06 06:35:42,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-06 06:35:42,356 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-06 06:35:42,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:42,357 INFO L89 Accepts]: Start accepts. Operand has 56 places, 44 transitions, 355 flow [2022-12-06 06:35:42,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:42,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:42,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 355 flow [2022-12-06 06:35:42,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 355 flow [2022-12-06 06:35:42,380 INFO L130 PetriNetUnfolder]: 60/172 cut-off events. [2022-12-06 06:35:42,380 INFO L131 PetriNetUnfolder]: For 677/729 co-relation queries the response was YES. [2022-12-06 06:35:42,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 172 events. 60/172 cut-off events. For 677/729 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 755 event pairs, 4 based on Foata normal form. 13/179 useless extension candidates. Maximal degree in co-relation 776. Up to 89 conditions per place. [2022-12-06 06:35:42,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 355 flow [2022-12-06 06:35:42,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 06:35:42,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:42,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 06:35:42,496 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 359 flow [2022-12-06 06:35:42,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:42,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:42,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:42,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:35:42,497 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -55765626, now seen corresponding path program 1 times [2022-12-06 06:35:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:42,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766814117] [2022-12-06 06:35:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:43,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766814117] [2022-12-06 06:35:43,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766814117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:43,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:43,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:35:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628986478] [2022-12-06 06:35:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:43,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:43,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:35:43,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 359 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:43,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:43,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:35:43,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:43,351 INFO L130 PetriNetUnfolder]: 265/536 cut-off events. [2022-12-06 06:35:43,351 INFO L131 PetriNetUnfolder]: For 2168/2168 co-relation queries the response was YES. [2022-12-06 06:35:43,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 536 events. 265/536 cut-off events. For 2168/2168 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2493 event pairs, 55 based on Foata normal form. 5/541 useless extension candidates. Maximal degree in co-relation 2648. Up to 322 conditions per place. [2022-12-06 06:35:43,355 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 40 selfloop transitions, 5 changer transitions 35/80 dead transitions. [2022-12-06 06:35:43,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 768 flow [2022-12-06 06:35:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:35:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:35:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 06:35:43,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-06 06:35:43,357 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 359 flow. Second operand 6 states and 51 transitions. [2022-12-06 06:35:43,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 768 flow [2022-12-06 06:35:43,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 692 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-12-06 06:35:43,368 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 289 flow [2022-12-06 06:35:43,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2022-12-06 06:35:43,369 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-06 06:35:43,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:43,369 INFO L89 Accepts]: Start accepts. Operand has 58 places, 37 transitions, 289 flow [2022-12-06 06:35:43,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:43,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:43,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 37 transitions, 289 flow [2022-12-06 06:35:43,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 37 transitions, 289 flow [2022-12-06 06:35:43,392 INFO L130 PetriNetUnfolder]: 48/150 cut-off events. [2022-12-06 06:35:43,393 INFO L131 PetriNetUnfolder]: For 451/481 co-relation queries the response was YES. [2022-12-06 06:35:43,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 150 events. 48/150 cut-off events. For 451/481 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 656 event pairs, 5 based on Foata normal form. 15/162 useless extension candidates. Maximal degree in co-relation 580. Up to 59 conditions per place. [2022-12-06 06:35:43,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 37 transitions, 289 flow [2022-12-06 06:35:43,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 06:35:43,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] L851-3-->L862: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_281 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_654 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_281 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_590 256) 0)) .cse2)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_655 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_590) v_~y$w_buff1_used~0_589) (= (mod v_~main$tmp_guard0~0_48 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|) (= v_~y$r_buff1_thd0~0_280 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_589 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_280 256) 0)))) 0 v_~y$r_buff1_thd0~0_281)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= v_~main$tmp_guard0~0_48 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|) (= v_~y$r_buff0_thd0~0_280 (ite .cse0 0 v_~y$r_buff0_thd0~0_281)) (= v_~y~0_556 (ite .cse4 v_~y$w_buff0~0_426 (ite .cse1 v_~y$w_buff1~0_372 v_~y~0_557))) (= (ite .cse4 0 v_~y$w_buff0_used~0_655) v_~y$w_buff0_used~0_654)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_655, ~y$w_buff1~0=v_~y$w_buff1~0_372, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_281, ~y$w_buff0~0=v_~y$w_buff0~0_426, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~y~0=v_~y~0_557, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_590} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_654, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_55|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_43|, ~y$w_buff1~0=v_~y$w_buff1~0_372, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_280, ~y$w_buff0~0=v_~y$w_buff0~0_426, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~y~0=v_~y~0_556, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_280, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_589, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ~y~0, ULTIMATE.start_main_#t~nondet12#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [401] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~y$r_buff1_thd3~0_82 256)))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_159 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_84 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_160 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_153 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_159 (ite .cse0 0 v_~y$w_buff0_used~0_160)) (= v_~y$r_buff0_thd3~0_83 (ite .cse1 0 v_~y$r_buff0_thd3~0_84)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_83 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_152 256) 0)) .cse3)) 0 v_~y$r_buff1_thd3~0_82) v_~y$r_buff1_thd3~0_81) (= v_~y$w_buff1_used~0_152 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_153)) (= v_~y~0_121 (ite .cse0 v_~y$w_buff0~0_71 (ite .cse4 v_~y$w_buff1~0_64 v_~y~0_122)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_82, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y~0=v_~y~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_153} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y~0=v_~y~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_152} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:35:43,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:43,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 06:35:43,694 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 287 flow [2022-12-06 06:35:43,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:43,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:43,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:35:43,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1688121730, now seen corresponding path program 1 times [2022-12-06 06:35:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:43,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949277909] [2022-12-06 06:35:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:45,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:45,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949277909] [2022-12-06 06:35:45,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949277909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:45,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:45,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:35:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810808070] [2022-12-06 06:35:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:45,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:35:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:35:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:35:45,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:35:45,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 287 flow. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:45,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:45,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:35:45,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:45,706 INFO L130 PetriNetUnfolder]: 167/354 cut-off events. [2022-12-06 06:35:45,706 INFO L131 PetriNetUnfolder]: For 1286/1286 co-relation queries the response was YES. [2022-12-06 06:35:45,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 354 events. 167/354 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1490 event pairs, 50 based on Foata normal form. 4/358 useless extension candidates. Maximal degree in co-relation 1712. Up to 207 conditions per place. [2022-12-06 06:35:45,709 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 32 selfloop transitions, 2 changer transitions 26/60 dead transitions. [2022-12-06 06:35:45,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 544 flow [2022-12-06 06:35:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 06:35:45,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 06:35:45,711 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 287 flow. Second operand 5 states and 40 transitions. [2022-12-06 06:35:45,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 544 flow [2022-12-06 06:35:45,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 512 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-06 06:35:45,719 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 227 flow [2022-12-06 06:35:45,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2022-12-06 06:35:45,720 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-06 06:35:45,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:45,720 INFO L89 Accepts]: Start accepts. Operand has 52 places, 32 transitions, 227 flow [2022-12-06 06:35:45,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:45,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:45,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 227 flow [2022-12-06 06:35:45,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 227 flow [2022-12-06 06:35:45,737 INFO L130 PetriNetUnfolder]: 40/123 cut-off events. [2022-12-06 06:35:45,737 INFO L131 PetriNetUnfolder]: For 260/273 co-relation queries the response was YES. [2022-12-06 06:35:45,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 123 events. 40/123 cut-off events. For 260/273 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 483 event pairs, 8 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 441. Up to 51 conditions per place. [2022-12-06 06:35:45,739 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 227 flow [2022-12-06 06:35:45,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:35:46,121 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] $Ultimate##0-->L806: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_158 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_156 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse9 .cse7)) (.cse5 (and (= (mod v_~y$w_buff1_used~0_325 256) 0) .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_357 256) 0))) (let ((.cse0 (or .cse3 .cse5 .cse11)) (.cse1 (and (not .cse11) .cse10)) (.cse8 (= (mod v_~y$w_buff1_used~0_324 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_356 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_130 256) 0)))) (and (= (ite .cse0 v_~y~0_284 (ite .cse1 v_~y$w_buff0~0_214 v_~y$w_buff1~0_186)) v_~__unbuffered_p2_EAX~0_51) (= v_~y$flush_delayed~0_111 0) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork1_#t~nondet4_14|) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y$w_buff1_used~0_324 (ite .cse2 v_~y$w_buff1_used~0_325 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_325 0))) (= v_~y~0_284 v_~y$mem_tmp~0_86) (= (ite .cse2 v_~y$r_buff1_thd3~0_158 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd3~0_155 256) 0))) (or (and .cse6 .cse7) .cse4 (and .cse6 .cse8))) v_~y$r_buff1_thd3~0_158 0)) v_~y$r_buff1_thd3~0_157) (= v_~y$w_buff0_used~0_356 (ite .cse2 v_~y$w_buff0_used~0_357 (ite .cse0 v_~y$w_buff0_used~0_357 (ite .cse1 0 v_~y$w_buff0_used~0_357)))) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= |v_P2Thread1of1ForFork1_#t~nondet3_14| v_~weak$$choice0~0_53) (= (ite .cse2 v_~y$r_buff0_thd3~0_156 (ite (or (and .cse9 .cse8) .cse3 .cse4) v_~y$r_buff0_thd3~0_156 (ite (and (not .cse4) .cse10) 0 v_~y$r_buff0_thd3~0_156))) v_~y$r_buff0_thd3~0_155) (= v_~y~0_283 (ite .cse2 v_~y$mem_tmp~0_86 v_~__unbuffered_p2_EAX~0_51)) (= v_~y$w_buff0~0_214 v_~y$w_buff0~0_213) (= v_~y$w_buff1~0_186 v_~y$w_buff1~0_185))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_158, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~y$w_buff1~0=v_~y$w_buff1~0_186, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_214, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_14|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_14|, ~y~0=v_~y~0_284, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$mem_tmp~0=v_~y$mem_tmp~0_86, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_185, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_213, ~y$flush_delayed~0=v_~y$flush_delayed~0_111, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_51, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_283, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [387] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_26 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_204 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_189 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_204) v_~y$w_buff0_used~0_203) (= v_~y$w_buff1_used~0_188 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_189)) (= v_~y$r_buff0_thd1~0_30 (ite .cse1 0 v_~y$r_buff0_thd1~0_31)) (= v_~y~0_161 (ite .cse0 v_~y$w_buff0~0_97 (ite .cse2 v_~y$w_buff1~0_92 v_~y~0_162))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse4 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_26) v_~y$r_buff1_thd1~0_25)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_162, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_161, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:35:46,384 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:35:46,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 664 [2022-12-06 06:35:46,385 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 233 flow [2022-12-06 06:35:46,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:46,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:46,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:46,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:35:46,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash 468012499, now seen corresponding path program 1 times [2022-12-06 06:35:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:46,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521730133] [2022-12-06 06:35:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521730133] [2022-12-06 06:35:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521730133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:47,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:47,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:35:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120154316] [2022-12-06 06:35:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:47,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:35:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:47,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:35:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:35:47,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:35:47,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 233 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:47,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:47,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:35:47,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:48,157 INFO L130 PetriNetUnfolder]: 99/210 cut-off events. [2022-12-06 06:35:48,157 INFO L131 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2022-12-06 06:35:48,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 210 events. 99/210 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 731 event pairs, 26 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 971. Up to 159 conditions per place. [2022-12-06 06:35:48,159 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-06 06:35:48,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 367 flow [2022-12-06 06:35:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:35:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:35:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 06:35:48,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 06:35:48,160 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 233 flow. Second operand 4 states and 30 transitions. [2022-12-06 06:35:48,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 367 flow [2022-12-06 06:35:48,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 338 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-06 06:35:48,163 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 230 flow [2022-12-06 06:35:48,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-12-06 06:35:48,163 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-06 06:35:48,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:48,164 INFO L89 Accepts]: Start accepts. Operand has 46 places, 32 transitions, 230 flow [2022-12-06 06:35:48,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:48,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:48,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 230 flow [2022-12-06 06:35:48,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 230 flow [2022-12-06 06:35:48,178 INFO L130 PetriNetUnfolder]: 39/121 cut-off events. [2022-12-06 06:35:48,178 INFO L131 PetriNetUnfolder]: For 211/226 co-relation queries the response was YES. [2022-12-06 06:35:48,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 121 events. 39/121 cut-off events. For 211/226 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 490 event pairs, 7 based on Foata normal form. 8/125 useless extension candidates. Maximal degree in co-relation 415. Up to 51 conditions per place. [2022-12-06 06:35:48,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 230 flow [2022-12-06 06:35:48,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:35:48,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L776: Formula: (and (= v_~y$w_buff0_used~0_629 v_~y$w_buff1_used~0_569) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~y$w_buff1~0_360 v_~y$w_buff0~0_409) (= v_~y$r_buff0_thd1~0_201 v_~y$r_buff1_thd1~0_150) (= v_~x~0_43 v_~__unbuffered_p1_EAX~0_67) (= v_~x~0_43 1) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= v_~y$w_buff0_used~0_628 1) (= 2 v_~y$w_buff0~0_408) (= v_~y~0_525 1) (= v_~y$r_buff0_thd0~0_268 v_~y$r_buff1_thd0~0_270) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~y$r_buff0_thd2~0_122 v_~y$r_buff1_thd2~0_127) (= v_~y$r_buff0_thd1~0_200 1) (= v_~y$r_buff0_thd3~0_279 v_~y$r_buff1_thd3~0_285) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_569 256) 0)) (not (= (mod v_~y$w_buff0_used~0_628 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_629, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, ~y$w_buff0~0=v_~y$w_buff0~0_409, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_201, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_628, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_150, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_285, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_408, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_200, ~y~0=v_~y~0_525, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_127, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~y$w_buff1~0=v_~y$w_buff1~0_360, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~x~0=v_~x~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_270, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_569} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [526] $Ultimate##0-->L763: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd3~0_312 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_307 256) 0))) (let ((.cse12 (not .cse9)) (.cse19 (and (= (mod v_~y$w_buff1_used~0_613 256) 0) .cse9)) (.cse20 (= (mod v_~y$w_buff0_used~0_678 256) 0)) (.cse10 (and .cse3 .cse9))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_209 256) 0))) (.cse16 (or .cse19 .cse20 .cse10)) (.cse17 (and (not .cse20) .cse12))) (let ((.cse15 (ite .cse2 v_~y$w_buff0_used~0_678 (ite .cse16 v_~y$w_buff0_used~0_678 (ite .cse17 0 v_~y$w_buff0_used~0_678))))) (let ((.cse6 (= (mod .cse15 256) 0))) (let ((.cse14 (ite .cse2 v_~y$w_buff1_used~0_613 (ite (or .cse19 .cse6 .cse10) v_~y$w_buff1_used~0_613 0)))) (let ((.cse11 (not .cse6)) (.cse1 (not (= (mod v_~y$r_buff1_thd1~0_159 256) 0))) (.cse5 (= (mod .cse14 256) 0)) (.cse18 (not (= (mod v_~y$r_buff0_thd1~0_215 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_676 256) 0)))) (let ((.cse13 (and .cse18 .cse0)) (.cse8 (and .cse1 (not .cse5))) (.cse7 (and .cse18 .cse11))) (and (= v_~y$w_buff0~0_441 v_~y$w_buff0~0_440) (= v_~y$flush_delayed~0_192 0) (= v_~y$r_buff1_thd1~0_158 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd1~0_214 256))) .cse0) (and (not (= (mod v_~y$w_buff1_used~0_611 256) 0)) .cse1)) 0 v_~y$r_buff1_thd1~0_159)) (= v_P2Thread1of1ForFork1_~arg.offset_18 |v_P2Thread1of1ForFork1_#in~arg.offset_18|) (= (ite .cse2 v_~y$r_buff1_thd3~0_312 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_306 256) 0))) (or (and .cse3 .cse4) (and .cse5 .cse4) .cse6)) v_~y$r_buff1_thd3~0_312 0)) v_~y$r_buff1_thd3~0_311) (= v_~weak$$choice2~0_209 |v_P2Thread1of1ForFork1_#t~nondet4_40|) (= v_~y~0_578 (ite .cse7 v_~y$w_buff0~0_440 (ite .cse8 v_~y$w_buff1~0_386 (ite .cse2 v_~y$mem_tmp~0_165 v_~__unbuffered_p2_EAX~0_86)))) (= (ite .cse2 v_~y$r_buff0_thd3~0_307 (ite (or (and .cse5 .cse9) .cse6 .cse10) v_~y$r_buff0_thd3~0_307 (ite (and .cse11 .cse12) 0 v_~y$r_buff0_thd3~0_307))) v_~y$r_buff0_thd3~0_306) (= v_~y$r_buff0_thd1~0_214 (ite .cse13 0 v_~y$r_buff0_thd1~0_215)) (= v_~y~0_580 v_~y$mem_tmp~0_165) (= v_~y$w_buff1~0_387 v_~y$w_buff1~0_386) (= (ite (or .cse13 .cse8) 0 .cse14) v_~y$w_buff1_used~0_611) (= v_~y$w_buff0_used~0_676 (ite .cse7 0 .cse15)) (= |v_P2Thread1of1ForFork1_#t~nondet3_40| v_~weak$$choice0~0_132) (= v_P2Thread1of1ForFork1_~arg.base_18 |v_P2Thread1of1ForFork1_#in~arg.base_18|) (= (ite .cse16 v_~y~0_580 (ite .cse17 v_~y$w_buff0~0_441 v_~y$w_buff1~0_387)) v_~__unbuffered_p2_EAX~0_86)))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_678, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_40|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_40|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_312, ~y$w_buff1~0=v_~y$w_buff1~0_387, ~y$w_buff0~0=v_~y$w_buff0~0_441, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_307, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_215, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_18|, ~y~0=v_~y~0_580, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_613} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_676, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_18, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_158, ~weak$$choice0~0=v_~weak$$choice0~0_132, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_311, ~y$w_buff1~0=v_~y$w_buff1~0_386, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_18, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_306, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_214, ~y$flush_delayed~0=v_~y$flush_delayed~0_192, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_18|, ~y~0=v_~y~0_578, ~weak$$choice2~0=v_~weak$$choice2~0_209, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_611} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:35:48,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L776: Formula: (and (= v_~y$w_buff0_used~0_629 v_~y$w_buff1_used~0_569) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_46| |v_P0Thread1of1ForFork2_~arg#1.offset_46|) (= v_~y$w_buff1~0_360 v_~y$w_buff0~0_409) (= v_~y$r_buff0_thd1~0_201 v_~y$r_buff1_thd1~0_150) (= v_~x~0_43 v_~__unbuffered_p1_EAX~0_67) (= v_~x~0_43 1) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= v_~y$w_buff0_used~0_628 1) (= 2 v_~y$w_buff0~0_408) (= v_~y~0_525 1) (= v_~y$r_buff0_thd0~0_268 v_~y$r_buff1_thd0~0_270) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~y$r_buff0_thd2~0_122 v_~y$r_buff1_thd2~0_127) (= v_~y$r_buff0_thd1~0_200 1) (= v_~y$r_buff0_thd3~0_279 v_~y$r_buff1_thd3~0_285) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_569 256) 0)) (not (= (mod v_~y$w_buff0_used~0_628 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_46| |v_P0Thread1of1ForFork2_~arg#1.base_46|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_629, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, ~y$w_buff0~0=v_~y$w_buff0~0_409, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_201, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_628, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_54|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_46|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_46|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_150, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_285, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_54|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_408, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_200, ~y~0=v_~y~0_525, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_46|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_46|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_127, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~y$w_buff1~0=v_~y$w_buff1~0_360, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~x~0=v_~x~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_270, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_569} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [525] $Ultimate##0-->L822: Formula: (let ((.cse21 (= (mod v_~y$r_buff1_thd3~0_307 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd3~0_302 256) 0))) (let ((.cse25 (not .cse23)) (.cse27 (= (mod v_~y$w_buff0_used~0_672 256) 0)) (.cse26 (and .cse23 (= (mod v_~y$w_buff1_used~0_607 256) 0))) (.cse24 (and .cse21 .cse23))) (let ((.cse19 (not (= (mod |v_P2Thread1of1ForFork1_#t~nondet4_36| 256) 0))) (.cse16 (or .cse27 .cse26 .cse24)) (.cse17 (and .cse25 (not .cse27)))) (let ((.cse13 (ite .cse19 v_~y$w_buff0_used~0_672 (ite .cse16 v_~y$w_buff0_used~0_672 (ite .cse17 0 v_~y$w_buff0_used~0_672))))) (let ((.cse20 (= (mod .cse13 256) 0))) (let ((.cse8 (ite .cse19 v_~y$w_buff1_used~0_607 (ite (or .cse20 .cse26 .cse24) v_~y$w_buff1_used~0_607 0)))) (let ((.cse22 (= (mod .cse8 256) 0)) (.cse18 (not .cse20))) (let ((.cse1 (ite .cse19 v_~y$r_buff0_thd3~0_302 (ite (or .cse20 (and .cse22 .cse23) .cse24) v_~y$r_buff0_thd3~0_302 (ite (and .cse25 .cse18) 0 v_~y$r_buff0_thd3~0_302))))) (let ((.cse4 (= (mod .cse1 256) 0))) (let ((.cse9 (and .cse22 .cse4))) (let ((.cse10 (ite .cse19 v_~y$r_buff1_thd3~0_307 (ite (or .cse20 .cse9 (and .cse21 .cse4)) v_~y$r_buff1_thd3~0_307 0)))) (let ((.cse11 (= (mod .cse10 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_605 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_670 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_205 256) 0))) (.cse14 (or .cse2 .cse20 .cse9)) (.cse7 (ite .cse19 v_~y~0_574 v_~__unbuffered_p2_EAX~0_84)) (.cse15 (and .cse18 .cse6))) (and (= v_~y$r_buff0_thd3~0_300 (ite .cse0 .cse1 (ite (or .cse2 (and .cse3 .cse4) .cse5) .cse1 (ite (and (not .cse5) .cse6) 0 .cse1)))) (= .cse7 v_~y$mem_tmp~0_161) (= v_P2Thread1of1ForFork1_~arg.base_16 |v_P2Thread1of1ForFork1_#in~arg.base_16|) (= v_~y$w_buff1~0_382 v_~y$w_buff1~0_380) (= v_~y$w_buff1_used~0_605 (ite .cse0 .cse8 (ite (or .cse2 .cse9 .cse5) .cse8 0))) (= v_~y$r_buff1_thd3~0_305 (ite .cse0 .cse10 (ite (let ((.cse12 (= (mod v_~y$r_buff0_thd3~0_300 256) 0))) (or (and .cse11 .cse12) (and .cse3 .cse12) .cse5)) .cse10 0))) (= v_~y$w_buff0_used~0_670 (ite .cse0 .cse13 (ite .cse14 .cse13 (ite .cse15 0 .cse13)))) (= |v_P2Thread1of1ForFork1_#t~nondet5_70| v_~weak$$choice0~0_128) (= v_~weak$$choice2~0_205 |v_P2Thread1of1ForFork1_#t~nondet6_70|) (= v_~__unbuffered_p2_EAX~0_84 (ite .cse16 v_~y~0_574 (ite .cse17 v_~y$w_buff0~0_436 v_~y$w_buff1~0_382))) (= (ite .cse0 v_~y$mem_tmp~0_161 v_~__unbuffered_p2_EBX~0_92) v_~y~0_572) (= v_P2Thread1of1ForFork1_~arg.offset_16 |v_P2Thread1of1ForFork1_#in~arg.offset_16|) (= v_~y$w_buff0~0_436 v_~y$w_buff0~0_434) (= v_~__unbuffered_p2_EBX~0_92 (ite .cse14 .cse7 (ite .cse15 v_~y$w_buff0~0_434 v_~y$w_buff1~0_382))) (= v_~y$flush_delayed~0_188 0)))))))))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_672, P2Thread1of1ForFork1_#t~nondet6=|v_P2Thread1of1ForFork1_#t~nondet6_70|, P2Thread1of1ForFork1_#t~nondet5=|v_P2Thread1of1ForFork1_#t~nondet5_70|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_36|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_307, ~y$w_buff1~0=v_~y$w_buff1~0_382, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_302, ~y$w_buff0~0=v_~y$w_buff0~0_436, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_16|, ~y~0=v_~y~0_574, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_607} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_670, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_16, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_35|, ~weak$$choice0~0=v_~weak$$choice0~0_128, ~y$mem_tmp~0=v_~y$mem_tmp~0_161, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_305, ~y$w_buff1~0=v_~y$w_buff1~0_380, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_16, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_300, ~y$w_buff0~0=v_~y$w_buff0~0_434, ~y$flush_delayed~0=v_~y$flush_delayed~0_188, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_16|, ~y~0=v_~y~0_572, ~weak$$choice2~0=v_~weak$$choice2~0_205, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_605} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet6, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet5, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:35:49,236 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:35:49,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1074 [2022-12-06 06:35:49,237 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 236 flow [2022-12-06 06:35:49,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:49,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:49,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:35:49,237 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1473507522, now seen corresponding path program 1 times [2022-12-06 06:35:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:49,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002999574] [2022-12-06 06:35:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:49,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:49,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:49,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002999574] [2022-12-06 06:35:49,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002999574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:49,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:35:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314113410] [2022-12-06 06:35:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:49,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:35:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:35:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:35:49,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:35:49,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:49,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:49,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:35:49,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:49,550 INFO L130 PetriNetUnfolder]: 79/174 cut-off events. [2022-12-06 06:35:49,551 INFO L131 PetriNetUnfolder]: For 511/511 co-relation queries the response was YES. [2022-12-06 06:35:49,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 174 events. 79/174 cut-off events. For 511/511 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 623 event pairs, 7 based on Foata normal form. 15/188 useless extension candidates. Maximal degree in co-relation 789. Up to 60 conditions per place. [2022-12-06 06:35:49,552 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 40 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2022-12-06 06:35:49,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 600 flow [2022-12-06 06:35:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:35:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:35:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-06 06:35:49,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-06 06:35:49,554 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 236 flow. Second operand 7 states and 47 transitions. [2022-12-06 06:35:49,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 600 flow [2022-12-06 06:35:49,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 489 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-06 06:35:49,557 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 214 flow [2022-12-06 06:35:49,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2022-12-06 06:35:49,558 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 06:35:49,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:49,558 INFO L89 Accepts]: Start accepts. Operand has 49 places, 32 transitions, 214 flow [2022-12-06 06:35:49,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:49,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:49,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 214 flow [2022-12-06 06:35:49,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 32 transitions, 214 flow [2022-12-06 06:35:49,570 INFO L130 PetriNetUnfolder]: 24/81 cut-off events. [2022-12-06 06:35:49,571 INFO L131 PetriNetUnfolder]: For 131/140 co-relation queries the response was YES. [2022-12-06 06:35:49,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 81 events. 24/81 cut-off events. For 131/140 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 3 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 288. Up to 29 conditions per place. [2022-12-06 06:35:49,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 214 flow [2022-12-06 06:35:49,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 06:35:50,448 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:35:50,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 891 [2022-12-06 06:35:50,449 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 210 flow [2022-12-06 06:35:50,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:50,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:50,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:50,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:35:50,449 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -828538210, now seen corresponding path program 1 times [2022-12-06 06:35:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232765626] [2022-12-06 06:35:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:35:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:50,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232765626] [2022-12-06 06:35:50,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232765626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:50,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:50,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:50,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508780508] [2022-12-06 06:35:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:50,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:50,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:50,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:50,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:35:50,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 210 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:50,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:50,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:35:50,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:50,978 INFO L130 PetriNetUnfolder]: 76/164 cut-off events. [2022-12-06 06:35:50,979 INFO L131 PetriNetUnfolder]: For 432/432 co-relation queries the response was YES. [2022-12-06 06:35:50,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 164 events. 76/164 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 582 event pairs, 27 based on Foata normal form. 1/165 useless extension candidates. Maximal degree in co-relation 744. Up to 72 conditions per place. [2022-12-06 06:35:50,981 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 28 selfloop transitions, 4 changer transitions 14/46 dead transitions. [2022-12-06 06:35:50,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 418 flow [2022-12-06 06:35:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-12-06 06:35:50,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-06 06:35:50,982 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 210 flow. Second operand 5 states and 29 transitions. [2022-12-06 06:35:50,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 418 flow [2022-12-06 06:35:50,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 358 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-06 06:35:50,984 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 171 flow [2022-12-06 06:35:50,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 06:35:50,985 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 06:35:50,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:50,985 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 171 flow [2022-12-06 06:35:50,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:50,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:50,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 171 flow [2022-12-06 06:35:50,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 06:35:50,995 INFO L130 PetriNetUnfolder]: 16/54 cut-off events. [2022-12-06 06:35:50,995 INFO L131 PetriNetUnfolder]: For 56/59 co-relation queries the response was YES. [2022-12-06 06:35:50,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 54 events. 16/54 cut-off events. For 56/59 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 149 event pairs, 2 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 172. Up to 14 conditions per place. [2022-12-06 06:35:50,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 06:35:50,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 06:35:51,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [387] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_26 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_204 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_189 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_204) v_~y$w_buff0_used~0_203) (= v_~y$w_buff1_used~0_188 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_189)) (= v_~y$r_buff0_thd1~0_30 (ite .cse1 0 v_~y$r_buff0_thd1~0_31)) (= v_~y~0_161 (ite .cse0 v_~y$w_buff0~0_97 (ite .cse2 v_~y$w_buff1~0_92 v_~y~0_162))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse4 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_26) v_~y$r_buff1_thd1~0_25)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_162, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_161, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] and [400] L806-->L822: Formula: (let ((.cse1 (= (mod v_~y$r_buff1_thd3~0_100 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd3~0_102 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~y$w_buff0_used~0_200 256) 0)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_185 256) 0) .cse7)) (.cse8 (and .cse7 .cse1))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_184 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_199 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_94 256) 0))) (.cse5 (or .cse11 .cse10 .cse8)) (.cse6 (and (not .cse11) .cse9))) (and (= v_~y~0_157 v_~y$mem_tmp~0_46) (= v_~y$w_buff0~0_94 v_~y$w_buff0~0_93) (= (ite .cse0 v_~y$r_buff1_thd3~0_100 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_101 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd3~0_100 0)) v_~y$r_buff1_thd3~0_99) (= 0 v_~y$flush_delayed~0_75) (= v_~y$w_buff1~0_89 v_~y$w_buff1~0_88) (= (ite .cse0 v_~y$w_buff0_used~0_200 (ite .cse5 v_~y$w_buff0_used~0_200 (ite .cse6 0 v_~y$w_buff0_used~0_200))) v_~y$w_buff0_used~0_199) (= v_~y$r_buff0_thd3~0_101 (ite .cse0 v_~y$r_buff0_thd3~0_102 (ite (or (and .cse4 .cse7) .cse3 .cse8) v_~y$r_buff0_thd3~0_102 (ite (and .cse9 (not .cse3)) 0 v_~y$r_buff0_thd3~0_102)))) (= |v_P2Thread1of1ForFork1_#t~nondet5_1| v_~weak$$choice0~0_17) (= v_~y$w_buff1_used~0_184 (ite .cse0 v_~y$w_buff1_used~0_185 (ite (or .cse3 .cse10 .cse8) v_~y$w_buff1_used~0_185 0))) (= v_~y~0_155 (ite .cse0 v_~y$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_22)) (= v_~__unbuffered_p2_EBX~0_22 (ite .cse5 v_~y~0_157 (ite .cse6 v_~y$w_buff0~0_94 v_~y$w_buff1~0_89))) (= |v_P2Thread1of1ForFork1_#t~nondet6_1| v_~weak$$choice2~0_94))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_89, P2Thread1of1ForFork1_#t~nondet6=|v_P2Thread1of1ForFork1_#t~nondet6_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_102, ~y$w_buff0~0=v_~y$w_buff0~0_94, P2Thread1of1ForFork1_#t~nondet5=|v_P2Thread1of1ForFork1_#t~nondet5_1|, ~y~0=v_~y~0_157, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_185} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_199, ~weak$$choice0~0=v_~weak$$choice0~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_46, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_88, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_93, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_184} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet6, P2Thread1of1ForFork1_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:35:51,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [387] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_26 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_204 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_189 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_204) v_~y$w_buff0_used~0_203) (= v_~y$w_buff1_used~0_188 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_189)) (= v_~y$r_buff0_thd1~0_30 (ite .cse1 0 v_~y$r_buff0_thd1~0_31)) (= v_~y~0_161 (ite .cse0 v_~y$w_buff0~0_97 (ite .cse2 v_~y$w_buff1~0_92 v_~y~0_162))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse4 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_26) v_~y$r_buff1_thd1~0_25)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_162, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$w_buff1~0=v_~y$w_buff1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_161, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] and [400] L806-->L822: Formula: (let ((.cse1 (= (mod v_~y$r_buff1_thd3~0_100 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd3~0_102 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (= (mod v_~y$w_buff0_used~0_200 256) 0)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_185 256) 0) .cse7)) (.cse8 (and .cse7 .cse1))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_184 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_199 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_94 256) 0))) (.cse5 (or .cse11 .cse10 .cse8)) (.cse6 (and (not .cse11) .cse9))) (and (= v_~y~0_157 v_~y$mem_tmp~0_46) (= v_~y$w_buff0~0_94 v_~y$w_buff0~0_93) (= (ite .cse0 v_~y$r_buff1_thd3~0_100 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_101 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd3~0_100 0)) v_~y$r_buff1_thd3~0_99) (= 0 v_~y$flush_delayed~0_75) (= v_~y$w_buff1~0_89 v_~y$w_buff1~0_88) (= (ite .cse0 v_~y$w_buff0_used~0_200 (ite .cse5 v_~y$w_buff0_used~0_200 (ite .cse6 0 v_~y$w_buff0_used~0_200))) v_~y$w_buff0_used~0_199) (= v_~y$r_buff0_thd3~0_101 (ite .cse0 v_~y$r_buff0_thd3~0_102 (ite (or (and .cse4 .cse7) .cse3 .cse8) v_~y$r_buff0_thd3~0_102 (ite (and .cse9 (not .cse3)) 0 v_~y$r_buff0_thd3~0_102)))) (= |v_P2Thread1of1ForFork1_#t~nondet5_1| v_~weak$$choice0~0_17) (= v_~y$w_buff1_used~0_184 (ite .cse0 v_~y$w_buff1_used~0_185 (ite (or .cse3 .cse10 .cse8) v_~y$w_buff1_used~0_185 0))) (= v_~y~0_155 (ite .cse0 v_~y$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_22)) (= v_~__unbuffered_p2_EBX~0_22 (ite .cse5 v_~y~0_157 (ite .cse6 v_~y$w_buff0~0_94 v_~y$w_buff1~0_89))) (= |v_P2Thread1of1ForFork1_#t~nondet6_1| v_~weak$$choice2~0_94))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_89, P2Thread1of1ForFork1_#t~nondet6=|v_P2Thread1of1ForFork1_#t~nondet6_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_102, ~y$w_buff0~0=v_~y$w_buff0~0_94, P2Thread1of1ForFork1_#t~nondet5=|v_P2Thread1of1ForFork1_#t~nondet5_1|, ~y~0=v_~y~0_157, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_185} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_199, ~weak$$choice0~0=v_~weak$$choice0~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_46, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_88, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_93, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_184} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet6, P2Thread1of1ForFork1_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:35:51,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] $Ultimate##0-->L806: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_158 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_156 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse9 .cse7)) (.cse5 (and (= (mod v_~y$w_buff1_used~0_325 256) 0) .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_357 256) 0))) (let ((.cse0 (or .cse3 .cse5 .cse11)) (.cse1 (and (not .cse11) .cse10)) (.cse8 (= (mod v_~y$w_buff1_used~0_324 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_356 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_130 256) 0)))) (and (= (ite .cse0 v_~y~0_284 (ite .cse1 v_~y$w_buff0~0_214 v_~y$w_buff1~0_186)) v_~__unbuffered_p2_EAX~0_51) (= v_~y$flush_delayed~0_111 0) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork1_#t~nondet4_14|) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y$w_buff1_used~0_324 (ite .cse2 v_~y$w_buff1_used~0_325 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_325 0))) (= v_~y~0_284 v_~y$mem_tmp~0_86) (= (ite .cse2 v_~y$r_buff1_thd3~0_158 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd3~0_155 256) 0))) (or (and .cse6 .cse7) .cse4 (and .cse6 .cse8))) v_~y$r_buff1_thd3~0_158 0)) v_~y$r_buff1_thd3~0_157) (= v_~y$w_buff0_used~0_356 (ite .cse2 v_~y$w_buff0_used~0_357 (ite .cse0 v_~y$w_buff0_used~0_357 (ite .cse1 0 v_~y$w_buff0_used~0_357)))) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= |v_P2Thread1of1ForFork1_#t~nondet3_14| v_~weak$$choice0~0_53) (= (ite .cse2 v_~y$r_buff0_thd3~0_156 (ite (or (and .cse9 .cse8) .cse3 .cse4) v_~y$r_buff0_thd3~0_156 (ite (and (not .cse4) .cse10) 0 v_~y$r_buff0_thd3~0_156))) v_~y$r_buff0_thd3~0_155) (= v_~y~0_283 (ite .cse2 v_~y$mem_tmp~0_86 v_~__unbuffered_p2_EAX~0_51)) (= v_~y$w_buff0~0_214 v_~y$w_buff0~0_213) (= v_~y$w_buff1~0_186 v_~y$w_buff1~0_185))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_158, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~y$w_buff1~0=v_~y$w_buff1~0_186, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_214, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_14|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_14|, ~y~0=v_~y~0_284, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$mem_tmp~0=v_~y$mem_tmp~0_86, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_185, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_213, ~y$flush_delayed~0=v_~y$flush_delayed~0_111, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_51, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_283, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [532] L756-->L822: Formula: (let ((.cse20 (not (= (mod v_~y$r_buff0_thd1~0_233 256) 0)))) (let ((.cse15 (and (not (= (mod v_~y$w_buff0_used~0_712 256) 0)) .cse20))) (let ((.cse18 (ite .cse15 0 v_~y$w_buff0_used~0_712))) (let ((.cse19 (= (mod .cse18 256) 0))) (let ((.cse12 (not (= (mod v_~y$r_buff1_thd1~0_173 256) 0))) (.cse14 (not .cse19))) (let ((.cse17 (and .cse14 .cse20)) (.cse16 (and .cse12 (not (= (mod v_~y$w_buff1_used~0_643 256) 0))))) (let ((.cse6 (ite (or .cse17 .cse16) 0 v_~y$w_buff1_used~0_643))) (let ((.cse13 (= (mod .cse6 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd3~0_328 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_323 256) 0))) (let ((.cse5 (not .cse2)) (.cse4 (and .cse2 .cse9)) (.cse7 (and .cse13 .cse2))) (let ((.cse1 (= (mod v_~y$w_buff0_used~0_710 256) 0)) (.cse3 (= (mod v_~y$w_buff1_used~0_641 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_219 256) 0))) (.cse10 (or .cse19 .cse4 .cse7)) (.cse11 (and .cse14 .cse5))) (and (= v_~y$r_buff0_thd3~0_322 (ite .cse0 v_~y$r_buff0_thd3~0_323 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd3~0_323 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd3~0_323)))) (= (ite .cse0 .cse6 (ite (or .cse1 .cse4 .cse7) .cse6 0)) v_~y$w_buff1_used~0_641) (= (ite .cse0 v_~y$r_buff1_thd3~0_328 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd3~0_322 256) 0))) (or (and .cse8 .cse9) .cse1 (and .cse3 .cse8))) v_~y$r_buff1_thd3~0_328 0)) v_~y$r_buff1_thd3~0_327) (= |v_P2Thread1of1ForFork1_#t~nondet5_82| v_~weak$$choice0~0_142) (= v_~__unbuffered_p2_EBX~0_100 (ite .cse10 v_~y$mem_tmp~0_175 (ite .cse11 v_~y$w_buff0~0_467 v_~y$w_buff1~0_409))) (= v_~y$flush_delayed~0_202 0) (= v_~y$r_buff1_thd1~0_172 (ite (or (and .cse12 (not .cse13)) (and .cse14 (not (= (mod v_~y$r_buff0_thd1~0_232 256) 0)))) 0 v_~y$r_buff1_thd1~0_173)) (= v_~y$mem_tmp~0_175 (ite .cse15 v_~y$w_buff0~0_467 (ite .cse16 v_~y$w_buff1~0_409 v_~y~0_610))) (= v_~y$w_buff0~0_467 v_~y$w_buff0~0_466) (= v_~y$r_buff0_thd1~0_232 (ite .cse17 0 v_~y$r_buff0_thd1~0_233)) (= v_~y~0_608 (ite .cse0 v_~y$mem_tmp~0_175 v_~__unbuffered_p2_EBX~0_100)) (= v_~weak$$choice2~0_219 |v_P2Thread1of1ForFork1_#t~nondet6_82|) (= v_~y$w_buff0_used~0_710 (ite .cse0 .cse18 (ite .cse10 .cse18 (ite .cse11 0 .cse18)))) (= v_~y$w_buff1~0_409 v_~y$w_buff1~0_408)))))))))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_173, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_328, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_712, ~y$w_buff1~0=v_~y$w_buff1~0_409, P2Thread1of1ForFork1_#t~nondet6=|v_P2Thread1of1ForFork1_#t~nondet6_82|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_323, ~y$w_buff0~0=v_~y$w_buff0~0_467, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_233, P2Thread1of1ForFork1_#t~nondet5=|v_P2Thread1of1ForFork1_#t~nondet5_82|, ~y~0=v_~y~0_610, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_643} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_710, ~weak$$choice0~0=v_~weak$$choice0~0_142, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_172, ~y$mem_tmp~0=v_~y$mem_tmp~0_175, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_327, ~y$w_buff1~0=v_~y$w_buff1~0_408, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_322, ~y$w_buff0~0=v_~y$w_buff0~0_466, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_232, ~y$flush_delayed~0=v_~y$flush_delayed~0_202, ~y~0=v_~y~0_608, ~weak$$choice2~0=v_~weak$$choice2~0_219, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_641} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet6, P2Thread1of1ForFork1_#t~nondet5, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:35:52,091 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:35:52,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1107 [2022-12-06 06:35:52,092 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 183 flow [2022-12-06 06:35:52,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:52,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:52,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:52,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:35:52,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:52,093 INFO L85 PathProgramCache]: Analyzing trace with hash 128083578, now seen corresponding path program 1 times [2022-12-06 06:35:52,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:52,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466796784] [2022-12-06 06:35:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:52,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:35:52,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:35:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:35:52,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:35:52,230 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:35:52,231 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:35:52,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:35:52,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:35:52,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:35:52,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:35:52,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:35:52,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:35:52,233 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:52,238 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:35:52,238 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:35:52,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:35:52 BasicIcfg [2022-12-06 06:35:52,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:35:52,315 INFO L158 Benchmark]: Toolchain (without parser) took 27154.99ms. Allocated memory was 185.6MB in the beginning and 736.1MB in the end (delta: 550.5MB). Free memory was 160.1MB in the beginning and 660.1MB in the end (delta: -499.9MB). Peak memory consumption was 51.8MB. Max. memory is 8.0GB. [2022-12-06 06:35:52,315 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 161.9MB in the beginning and 161.8MB in the end (delta: 131.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:35:52,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.00ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 131.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:35:52,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.11ms. Allocated memory is still 185.6MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:35:52,316 INFO L158 Benchmark]: Boogie Preprocessor took 51.58ms. Allocated memory is still 185.6MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:35:52,316 INFO L158 Benchmark]: RCFGBuilder took 783.61ms. Allocated memory is still 185.6MB. Free memory was 126.3MB in the beginning and 77.0MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-12-06 06:35:52,316 INFO L158 Benchmark]: TraceAbstraction took 25667.82ms. Allocated memory was 185.6MB in the beginning and 736.1MB in the end (delta: 550.5MB). Free memory was 76.5MB in the beginning and 660.1MB in the end (delta: -583.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:35:52,317 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 161.9MB in the beginning and 161.8MB in the end (delta: 131.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 599.00ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 131.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.11ms. Allocated memory is still 185.6MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.58ms. Allocated memory is still 185.6MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 783.61ms. Allocated memory is still 185.6MB. Free memory was 126.3MB in the beginning and 77.0MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 25667.82ms. Allocated memory was 185.6MB in the beginning and 736.1MB in the end (delta: 550.5MB). Free memory was 76.5MB in the beginning and 660.1MB in the end (delta: -583.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 113 PlacesBefore, 38 PlacesAfterwards, 105 TransitionsBefore, 29 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1486, independent: 1435, independent conditional: 1435, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1486, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1486, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1486, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1122, independent: 1093, independent conditional: 0, independent unconditional: 1093, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1122, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 272, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1486, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1122, unknown conditional: 0, unknown unconditional: 1122] , Statistics on independence cache: Total cache size (in pairs): 1755, Positive cache size: 1726, Positive conditional cache size: 0, Positive unconditional cache size: 1726, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 110, independent conditional: 25, independent unconditional: 85, dependent: 45, dependent conditional: 12, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 110, independent conditional: 25, independent unconditional: 85, dependent: 45, dependent conditional: 12, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 110, independent conditional: 25, independent unconditional: 85, dependent: 45, dependent conditional: 12, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 12, independent unconditional: 48, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 126, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 124, dependent conditional: 41, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 50, independent conditional: 13, independent unconditional: 37, dependent: 25, dependent conditional: 5, dependent unconditional: 20, unknown: 80, unknown conditional: 19, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 60, Positive conditional cache size: 12, Positive unconditional cache size: 48, Negative cache size: 20, Negative conditional cache size: 7, Negative unconditional cache size: 13, 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, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 1, independent unconditional: 51, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 18, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 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: 72, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 75, Positive conditional cache size: 12, Positive unconditional cache size: 63, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 49, independent conditional: 5, independent unconditional: 44, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 68, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 75, Positive conditional cache size: 12, Positive unconditional cache size: 63, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 115, independent: 82, independent conditional: 22, independent unconditional: 60, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 96, Positive conditional cache size: 12, Positive unconditional cache size: 84, Negative cache size: 30, Negative conditional cache size: 7, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 79, independent conditional: 35, independent unconditional: 44, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 79, independent conditional: 14, independent unconditional: 65, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 79, independent conditional: 14, independent unconditional: 65, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 67, independent conditional: 10, independent unconditional: 57, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 122, Positive conditional cache size: 18, Positive unconditional cache size: 104, Negative cache size: 30, Negative conditional cache size: 7, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 38, independent unconditional: 10, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 48, independent conditional: 12, independent unconditional: 36, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 12, independent unconditional: 36, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 45, independent conditional: 12, independent unconditional: 33, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 133, Positive conditional cache size: 20, Positive unconditional cache size: 113, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 190, independent conditional: 190, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 190, independent conditional: 128, independent unconditional: 62, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 190, independent conditional: 64, independent unconditional: 126, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 190, independent conditional: 64, independent unconditional: 126, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 214, independent: 190, independent conditional: 64, independent unconditional: 126, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 149, Positive conditional cache size: 24, Positive unconditional cache size: 125, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, 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: 44, independent: 44, independent conditional: 35, independent unconditional: 9, 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: 44, independent: 44, independent conditional: 13, independent unconditional: 31, 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: 44, independent: 44, independent conditional: 13, independent unconditional: 31, 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: 12, independent: 12, independent conditional: 3, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 44, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 175, Positive conditional cache size: 29, Positive unconditional cache size: 146, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 54 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 8, 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: 11, independent: 11, independent conditional: 6, independent unconditional: 5, 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: 11, independent: 11, independent conditional: 6, independent unconditional: 5, 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: 11, independent: 11, independent conditional: 6, independent unconditional: 5, 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): 208, Positive cache size: 177, Positive conditional cache size: 29, Positive unconditional cache size: 148, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 55 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 182, Positive conditional cache size: 29, Positive unconditional cache size: 153, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 49 PlacesBefore, 49 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 191, Positive conditional cache size: 29, Positive unconditional cache size: 162, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 46 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 191, Positive conditional cache size: 29, Positive unconditional cache size: 162, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 47 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 193, Positive conditional cache size: 29, Positive unconditional cache size: 164, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 205, Positive conditional cache size: 29, Positive unconditional cache size: 176, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={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] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={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] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={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] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 [L772] 1 __unbuffered_p1_EAX = x [L775] 1 y = 1 [L792] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 1 y$flush_delayed = weak$$choice2 [L795] 1 y$mem_tmp = y [L796] 1 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 1 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 1 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 1 __unbuffered_p2_EAX = y [L804] 1 y = y$flush_delayed ? y$mem_tmp : y [L805] 1 y$flush_delayed = (_Bool)0 [L808] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 1 y$flush_delayed = weak$$choice2 [L811] 1 y$mem_tmp = y [L812] 1 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 1 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 1 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 1 __unbuffered_p2_EBX = y [L820] 1 y = y$flush_delayed ? y$mem_tmp : y [L821] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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, 135 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: 25.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1229 IncrementalHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 8 mSDtfsCounter, 1229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=394occurred in iteration=8, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:35:52,362 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...