/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/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:46:21,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:46:21,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:46:21,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:46:21,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:46:21,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:46:21,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:46:21,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:46:21,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:46:21,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:46:21,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:46:21,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:46:21,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:46:21,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:46:21,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:46:21,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:46:21,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:46:21,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:46:21,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:46:21,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:46:21,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:46:21,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:46:21,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:46:21,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:46:21,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:46:21,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:46:21,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:46:21,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:46:21,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:46:21,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:46:21,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:46:21,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:46:21,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:46:21,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:46:21,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:46:21,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:46:21,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:46:21,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:46:21,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:46:21,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:46:21,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:46:21,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:46:22,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:46:22,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:46:22,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:46:22,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:46:22,010 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:46:22,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:46:22,011 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:46:22,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:46:22,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:46:22,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:46:22,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:46:22,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:46:22,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:46:22,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:46:22,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:46:22,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:46:22,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:46:22,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:46:22,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:46:22,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:46:22,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:46:22,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:22,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:46:22,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:46:22,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:46:22,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:46:22,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:46:22,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:46:22,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:46:22,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:46:22,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:46:22,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:46:22,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:46:22,389 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:46:22,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-13 11:46:23,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:46:23,821 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:46:23,821 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-13 11:46:23,837 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f9f1790/e3dcdd6da7ed4e34b112392804d18f1e/FLAGa42d707b6 [2022-12-13 11:46:23,852 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f9f1790/e3dcdd6da7ed4e34b112392804d18f1e [2022-12-13 11:46:23,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:46:23,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:46:23,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:23,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:46:23,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:46:23,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:23" (1/1) ... [2022-12-13 11:46:23,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d09b7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:23, skipping insertion in model container [2022-12-13 11:46:23,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:23" (1/1) ... [2022-12-13 11:46:23,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:46:23,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:46:24,045 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/mix013.opt.i[944,957] [2022-12-13 11:46:24,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:24,286 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:46:24,296 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/mix013.opt.i[944,957] [2022-12-13 11:46:24,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:24,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:24,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:24,372 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:46:24,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24 WrapperNode [2022-12-13 11:46:24,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:24,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:24,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:46:24,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:46:24,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,455 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-13 11:46:24,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:24,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:46:24,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:46:24,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:46:24,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,495 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:46:24,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:46:24,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:46:24,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:46:24,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (1/1) ... [2022-12-13 11:46:24,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:46:24,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:46:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:46:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:46:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:46:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:46:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:46:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:46:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:46:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:46:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:46:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:46:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:46:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:46:24,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:46:24,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:46:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:46:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:46:24,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:46:24,595 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:46:24,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:46:24,770 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:46:24,772 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:46:25,118 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:46:25,276 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:46:25,276 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:46:25,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:25 BoogieIcfgContainer [2022-12-13 11:46:25,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:46:25,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:46:25,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:46:25,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:46:25,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:46:23" (1/3) ... [2022-12-13 11:46:25,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782199b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:25, skipping insertion in model container [2022-12-13 11:46:25,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:24" (2/3) ... [2022-12-13 11:46:25,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782199b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:25, skipping insertion in model container [2022-12-13 11:46:25,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:25" (3/3) ... [2022-12-13 11:46:25,287 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-12-13 11:46:25,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:46:25,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:46:25,306 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:46:25,369 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:46:25,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 11:46:25,550 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 11:46:25,550 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:25,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:46:25,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 11:46:25,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-13 11:46:25,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:25,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 11:46:25,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-13 11:46:25,644 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 11:46:25,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:25,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:46:25,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 11:46:25,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 2850 [2022-12-13 11:46:31,525 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 11:46:31,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:46:31,552 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;@75bc66fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:46:31,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:46:31,557 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 11:46:31,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:31,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:31,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:31,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1639690117, now seen corresponding path program 1 times [2022-12-13 11:46:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:31,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081038681] [2022-12-13 11:46:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081038681] [2022-12-13 11:46:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081038681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:32,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:32,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539884345] [2022-12-13 11:46:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:32,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:32,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 65 [2022-12-13 11:46:32,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:32,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:32,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 65 [2022-12-13 11:46:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:37,325 INFO L130 PetriNetUnfolder]: 40551/58273 cut-off events. [2022-12-13 11:46:37,326 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-13 11:46:37,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112193 conditions, 58273 events. 40551/58273 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 4222. Compared 461183 event pairs, 5311 based on Foata normal form. 0/35858 useless extension candidates. Maximal degree in co-relation 112181. Up to 46041 conditions per place. [2022-12-13 11:46:37,694 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 37 selfloop transitions, 2 changer transitions 46/99 dead transitions. [2022-12-13 11:46:37,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 380 flow [2022-12-13 11:46:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-12-13 11:46:37,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:46:37,709 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 142 flow. Second operand 3 states and 130 transitions. [2022-12-13 11:46:37,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 380 flow [2022-12-13 11:46:37,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:46:37,717 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 92 flow [2022-12-13 11:46:37,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2022-12-13 11:46:37,725 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-13 11:46:37,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:37,726 INFO L89 Accepts]: Start accepts. Operand has 74 places, 40 transitions, 92 flow [2022-12-13 11:46:37,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:37,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:37,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 40 transitions, 92 flow [2022-12-13 11:46:37,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2022-12-13 11:46:37,750 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-13 11:46:37,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:37,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 103 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:46:37,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2022-12-13 11:46:37,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-13 11:46:37,933 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:37,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-13 11:46:37,935 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 92 flow [2022-12-13 11:46:37,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:37,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:37,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:37,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:46:37,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 510921208, now seen corresponding path program 1 times [2022-12-13 11:46:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:37,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966957200] [2022-12-13 11:46:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:38,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966957200] [2022-12-13 11:46:38,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966957200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:38,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:38,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126726177] [2022-12-13 11:46:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:38,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:38,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:38,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 11:46:38,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:38,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:38,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 11:46:38,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:40,144 INFO L130 PetriNetUnfolder]: 16998/23682 cut-off events. [2022-12-13 11:46:40,144 INFO L131 PetriNetUnfolder]: For 734/734 co-relation queries the response was YES. [2022-12-13 11:46:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47403 conditions, 23682 events. 16998/23682 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 131356 event pairs, 8337 based on Foata normal form. 0/18729 useless extension candidates. Maximal degree in co-relation 47393. Up to 22364 conditions per place. [2022-12-13 11:46:40,278 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 2/57 dead transitions. [2022-12-13 11:46:40,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 230 flow [2022-12-13 11:46:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 11:46:40,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 11:46:40,279 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 92 flow. Second operand 3 states and 76 transitions. [2022-12-13 11:46:40,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 230 flow [2022-12-13 11:46:40,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:40,283 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 119 flow [2022-12-13 11:46:40,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-13 11:46:40,284 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2022-12-13 11:46:40,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:40,285 INFO L89 Accepts]: Start accepts. Operand has 52 places, 43 transitions, 119 flow [2022-12-13 11:46:40,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:40,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:40,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 119 flow [2022-12-13 11:46:40,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 119 flow [2022-12-13 11:46:40,303 INFO L130 PetriNetUnfolder]: 45/199 cut-off events. [2022-12-13 11:46:40,304 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:40,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 199 events. 45/199 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1046 event pairs, 23 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 282. Up to 76 conditions per place. [2022-12-13 11:46:40,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 119 flow [2022-12-13 11:46:40,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 984 [2022-12-13 11:46:40,329 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:40,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 11:46:40,332 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 119 flow [2022-12-13 11:46:40,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:40,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:40,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:40,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:46:40,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 318429904, now seen corresponding path program 1 times [2022-12-13 11:46:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:40,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114928912] [2022-12-13 11:46:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:40,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114928912] [2022-12-13 11:46:40,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114928912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:40,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:40,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453571461] [2022-12-13 11:46:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:40,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:40,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:46:40,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:40,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:40,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:46:40,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:41,758 INFO L130 PetriNetUnfolder]: 12577/17592 cut-off events. [2022-12-13 11:46:41,759 INFO L131 PetriNetUnfolder]: For 2733/2733 co-relation queries the response was YES. [2022-12-13 11:46:41,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38551 conditions, 17592 events. 12577/17592 cut-off events. For 2733/2733 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 92377 event pairs, 3513 based on Foata normal form. 284/14872 useless extension candidates. Maximal degree in co-relation 38540. Up to 12401 conditions per place. [2022-12-13 11:46:41,862 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2022-12-13 11:46:41,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 253 flow [2022-12-13 11:46:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 11:46:41,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239 [2022-12-13 11:46:41,864 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 119 flow. Second operand 3 states and 73 transitions. [2022-12-13 11:46:41,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 253 flow [2022-12-13 11:46:41,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:41,866 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 125 flow [2022-12-13 11:46:41,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 11:46:41,867 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-13 11:46:41,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:41,867 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 125 flow [2022-12-13 11:46:41,869 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:41,869 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:41,869 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 125 flow [2022-12-13 11:46:41,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 125 flow [2022-12-13 11:46:41,884 INFO L130 PetriNetUnfolder]: 29/128 cut-off events. [2022-12-13 11:46:41,884 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-13 11:46:41,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 128 events. 29/128 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 615 event pairs, 11 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 208. Up to 53 conditions per place. [2022-12-13 11:46:41,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 125 flow [2022-12-13 11:46:41,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 980 [2022-12-13 11:46:41,910 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:41,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 11:46:41,911 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 125 flow [2022-12-13 11:46:41,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:41,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:41,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:41,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:46:41,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1265487897, now seen corresponding path program 1 times [2022-12-13 11:46:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:41,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652566570] [2022-12-13 11:46:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:42,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652566570] [2022-12-13 11:46:42,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652566570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:42,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:42,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221313608] [2022-12-13 11:46:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:42,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:42,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:42,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:42,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:46:42,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:42,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:42,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:46:42,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:43,165 INFO L130 PetriNetUnfolder]: 11727/16573 cut-off events. [2022-12-13 11:46:43,166 INFO L131 PetriNetUnfolder]: For 4589/4589 co-relation queries the response was YES. [2022-12-13 11:46:43,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37229 conditions, 16573 events. 11727/16573 cut-off events. For 4589/4589 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 91070 event pairs, 4351 based on Foata normal form. 250/13969 useless extension candidates. Maximal degree in co-relation 37216. Up to 11568 conditions per place. [2022-12-13 11:46:43,267 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 51 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-13 11:46:43,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 286 flow [2022-12-13 11:46:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 11:46:43,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:46:43,269 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 125 flow. Second operand 3 states and 78 transitions. [2022-12-13 11:46:43,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 286 flow [2022-12-13 11:46:43,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:43,279 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 130 flow [2022-12-13 11:46:43,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 11:46:43,281 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2022-12-13 11:46:43,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:43,281 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 130 flow [2022-12-13 11:46:43,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:43,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:43,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 130 flow [2022-12-13 11:46:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 130 flow [2022-12-13 11:46:43,295 INFO L130 PetriNetUnfolder]: 21/116 cut-off events. [2022-12-13 11:46:43,295 INFO L131 PetriNetUnfolder]: For 19/33 co-relation queries the response was YES. [2022-12-13 11:46:43,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 116 events. 21/116 cut-off events. For 19/33 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 558 event pairs, 8 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 192. Up to 41 conditions per place. [2022-12-13 11:46:43,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 130 flow [2022-12-13 11:46:43,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 976 [2022-12-13 11:46:43,301 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:43,306 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:46:43,306 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 130 flow [2022-12-13 11:46:43,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:43,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:43,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:43,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:46:43,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1635787044, now seen corresponding path program 1 times [2022-12-13 11:46:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:43,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675602348] [2022-12-13 11:46:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675602348] [2022-12-13 11:46:43,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675602348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:43,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:43,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488553320] [2022-12-13 11:46:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:43,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:43,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:46:43,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:43,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:43,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:46:43,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:44,802 INFO L130 PetriNetUnfolder]: 15435/20942 cut-off events. [2022-12-13 11:46:44,802 INFO L131 PetriNetUnfolder]: For 5365/5479 co-relation queries the response was YES. [2022-12-13 11:46:44,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46924 conditions, 20942 events. 15435/20942 cut-off events. For 5365/5479 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 122799 event pairs, 5606 based on Foata normal form. 82/13168 useless extension candidates. Maximal degree in co-relation 46910. Up to 20380 conditions per place. [2022-12-13 11:46:44,968 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 44 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2022-12-13 11:46:44,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 305 flow [2022-12-13 11:46:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 11:46:44,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7094017094017094 [2022-12-13 11:46:44,972 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 130 flow. Second operand 3 states and 83 transitions. [2022-12-13 11:46:44,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 305 flow [2022-12-13 11:46:44,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:44,977 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 213 flow [2022-12-13 11:46:44,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 11:46:44,980 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-13 11:46:44,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:44,981 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 213 flow [2022-12-13 11:46:44,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:44,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:44,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 213 flow [2022-12-13 11:46:44,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 213 flow [2022-12-13 11:46:45,229 INFO L130 PetriNetUnfolder]: 2612/4222 cut-off events. [2022-12-13 11:46:45,230 INFO L131 PetriNetUnfolder]: For 519/579 co-relation queries the response was YES. [2022-12-13 11:46:45,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8573 conditions, 4222 events. 2612/4222 cut-off events. For 519/579 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 29207 event pairs, 1434 based on Foata normal form. 3/1915 useless extension candidates. Maximal degree in co-relation 8561. Up to 3637 conditions per place. [2022-12-13 11:46:45,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 213 flow [2022-12-13 11:46:45,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-13 11:46:45,289 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:45,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-13 11:46:45,290 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 213 flow [2022-12-13 11:46:45,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:45,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:45,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:45,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:46:45,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1983882691, now seen corresponding path program 1 times [2022-12-13 11:46:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:45,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257720009] [2022-12-13 11:46:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257720009] [2022-12-13 11:46:45,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257720009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:45,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:45,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553053758] [2022-12-13 11:46:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:45,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:45,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:45,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:45,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:46:45,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:45,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:45,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:46:45,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:46,743 INFO L130 PetriNetUnfolder]: 11013/15605 cut-off events. [2022-12-13 11:46:46,744 INFO L131 PetriNetUnfolder]: For 5007/6264 co-relation queries the response was YES. [2022-12-13 11:46:46,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45185 conditions, 15605 events. 11013/15605 cut-off events. For 5007/6264 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 96053 event pairs, 2276 based on Foata normal form. 404/10191 useless extension candidates. Maximal degree in co-relation 45170. Up to 13600 conditions per place. [2022-12-13 11:46:46,806 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 55 selfloop transitions, 25 changer transitions 0/91 dead transitions. [2022-12-13 11:46:46,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 489 flow [2022-12-13 11:46:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-13 11:46:46,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2022-12-13 11:46:46,807 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 213 flow. Second operand 4 states and 115 transitions. [2022-12-13 11:46:46,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 489 flow [2022-12-13 11:46:46,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:46,813 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 348 flow [2022-12-13 11:46:46,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-13 11:46:46,813 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-13 11:46:46,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:46,814 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 348 flow [2022-12-13 11:46:46,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:46,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:46,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 348 flow [2022-12-13 11:46:46,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 348 flow [2022-12-13 11:46:46,970 INFO L130 PetriNetUnfolder]: 2024/3472 cut-off events. [2022-12-13 11:46:46,970 INFO L131 PetriNetUnfolder]: For 588/1068 co-relation queries the response was YES. [2022-12-13 11:46:46,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10324 conditions, 3472 events. 2024/3472 cut-off events. For 588/1068 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 24395 event pairs, 582 based on Foata normal form. 11/1648 useless extension candidates. Maximal degree in co-relation 10310. Up to 2989 conditions per place. [2022-12-13 11:46:46,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 67 transitions, 348 flow [2022-12-13 11:46:46,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-13 11:46:47,013 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:47,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-13 11:46:47,014 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 348 flow [2022-12-13 11:46:47,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:47,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:47,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:47,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:46:47,015 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 732133419, now seen corresponding path program 1 times [2022-12-13 11:46:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:47,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660736774] [2022-12-13 11:46:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:47,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-13 11:46:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660736774] [2022-12-13 11:46:47,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660736774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:47,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:47,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494724354] [2022-12-13 11:46:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:47,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:47,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:47,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:47,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2022-12-13 11:46:47,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:47,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:47,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2022-12-13 11:46:47,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:48,761 INFO L130 PetriNetUnfolder]: 15064/22701 cut-off events. [2022-12-13 11:46:48,761 INFO L131 PetriNetUnfolder]: For 17125/19659 co-relation queries the response was YES. [2022-12-13 11:46:48,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77828 conditions, 22701 events. 15064/22701 cut-off events. For 17125/19659 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 161355 event pairs, 2678 based on Foata normal form. 866/18878 useless extension candidates. Maximal degree in co-relation 77811. Up to 13516 conditions per place. [2022-12-13 11:46:48,898 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 111 selfloop transitions, 3 changer transitions 4/137 dead transitions. [2022-12-13 11:46:48,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 137 transitions, 958 flow [2022-12-13 11:46:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 11:46:48,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 11:46:48,900 INFO L175 Difference]: Start difference. First operand has 58 places, 67 transitions, 348 flow. Second operand 4 states and 112 transitions. [2022-12-13 11:46:48,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 137 transitions, 958 flow [2022-12-13 11:46:48,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 137 transitions, 852 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:48,907 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 323 flow [2022-12-13 11:46:48,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2022-12-13 11:46:48,908 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2022-12-13 11:46:48,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:48,908 INFO L89 Accepts]: Start accepts. Operand has 61 places, 69 transitions, 323 flow [2022-12-13 11:46:48,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:48,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:48,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 69 transitions, 323 flow [2022-12-13 11:46:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 69 transitions, 323 flow [2022-12-13 11:46:49,161 INFO L130 PetriNetUnfolder]: 3787/6254 cut-off events. [2022-12-13 11:46:49,161 INFO L131 PetriNetUnfolder]: For 1592/2111 co-relation queries the response was YES. [2022-12-13 11:46:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 6254 events. 3787/6254 cut-off events. For 1592/2111 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 45635 event pairs, 1055 based on Foata normal form. 17/2752 useless extension candidates. Maximal degree in co-relation 17875. Up to 5644 conditions per place. [2022-12-13 11:46:49,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 69 transitions, 323 flow [2022-12-13 11:46:49,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 1572 [2022-12-13 11:46:49,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] $Ultimate##0-->L772: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_16 1)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [384] L757-->L760: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 11:46:49,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:49,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 391 [2022-12-13 11:46:49,299 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 326 flow [2022-12-13 11:46:49,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:49,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:49,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:49,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:46:49,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -266499016, now seen corresponding path program 1 times [2022-12-13 11:46:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632057245] [2022-12-13 11:46:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:49,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632057245] [2022-12-13 11:46:49,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632057245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:49,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:49,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067910819] [2022-12-13 11:46:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:49,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:46:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:46:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:46:49,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 11:46:49,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:49,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:49,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 11:46:49,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:50,652 INFO L130 PetriNetUnfolder]: 9930/15045 cut-off events. [2022-12-13 11:46:50,652 INFO L131 PetriNetUnfolder]: For 8896/13217 co-relation queries the response was YES. [2022-12-13 11:46:50,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50939 conditions, 15045 events. 9930/15045 cut-off events. For 8896/13217 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 103435 event pairs, 1400 based on Foata normal form. 962/9822 useless extension candidates. Maximal degree in co-relation 50921. Up to 8884 conditions per place. [2022-12-13 11:46:50,720 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 64 selfloop transitions, 37 changer transitions 1/114 dead transitions. [2022-12-13 11:46:50,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 114 transitions, 704 flow [2022-12-13 11:46:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 11:46:50,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 11:46:50,721 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 326 flow. Second operand 5 states and 146 transitions. [2022-12-13 11:46:50,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 114 transitions, 704 flow [2022-12-13 11:46:50,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 114 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:50,730 INFO L231 Difference]: Finished difference. Result has 65 places, 80 transitions, 510 flow [2022-12-13 11:46:50,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=65, PETRI_TRANSITIONS=80} [2022-12-13 11:46:50,730 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2022-12-13 11:46:50,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:50,731 INFO L89 Accepts]: Start accepts. Operand has 65 places, 80 transitions, 510 flow [2022-12-13 11:46:50,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:50,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:50,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 80 transitions, 510 flow [2022-12-13 11:46:50,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 80 transitions, 510 flow [2022-12-13 11:46:50,946 INFO L130 PetriNetUnfolder]: 2146/4253 cut-off events. [2022-12-13 11:46:50,946 INFO L131 PetriNetUnfolder]: For 2172/2613 co-relation queries the response was YES. [2022-12-13 11:46:50,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16483 conditions, 4253 events. 2146/4253 cut-off events. For 2172/2613 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 35023 event pairs, 200 based on Foata normal form. 17/2096 useless extension candidates. Maximal degree in co-relation 16466. Up to 3547 conditions per place. [2022-12-13 11:46:51,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 80 transitions, 510 flow [2022-12-13 11:46:51,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 1574 [2022-12-13 11:46:51,125 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:51,126 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 395 [2022-12-13 11:46:51,126 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 80 transitions, 512 flow [2022-12-13 11:46:51,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:51,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:51,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:51,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:46:51,127 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:51,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1068762313, now seen corresponding path program 1 times [2022-12-13 11:46:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:51,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430943002] [2022-12-13 11:46:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:51,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:51,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430943002] [2022-12-13 11:46:51,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430943002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:51,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:51,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148040134] [2022-12-13 11:46:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:51,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:51,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 11:46:51,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 80 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:51,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:51,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 11:46:51,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:53,452 INFO L130 PetriNetUnfolder]: 16147/25616 cut-off events. [2022-12-13 11:46:53,453 INFO L131 PetriNetUnfolder]: For 34257/37346 co-relation queries the response was YES. [2022-12-13 11:46:53,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103200 conditions, 25616 events. 16147/25616 cut-off events. For 34257/37346 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 191249 event pairs, 1142 based on Foata normal form. 1700/22060 useless extension candidates. Maximal degree in co-relation 103180. Up to 14467 conditions per place. [2022-12-13 11:46:53,558 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 128 selfloop transitions, 15 changer transitions 6/170 dead transitions. [2022-12-13 11:46:53,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 170 transitions, 1365 flow [2022-12-13 11:46:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-12-13 11:46:53,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 11:46:53,560 INFO L175 Difference]: Start difference. First operand has 65 places, 80 transitions, 512 flow. Second operand 5 states and 130 transitions. [2022-12-13 11:46:53,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 170 transitions, 1365 flow [2022-12-13 11:46:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 170 transitions, 1155 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:54,113 INFO L231 Difference]: Finished difference. Result has 68 places, 89 transitions, 517 flow [2022-12-13 11:46:54,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=68, PETRI_TRANSITIONS=89} [2022-12-13 11:46:54,114 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2022-12-13 11:46:54,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:54,114 INFO L89 Accepts]: Start accepts. Operand has 68 places, 89 transitions, 517 flow [2022-12-13 11:46:54,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:54,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:54,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 89 transitions, 517 flow [2022-12-13 11:46:54,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 89 transitions, 517 flow [2022-12-13 11:46:54,807 INFO L130 PetriNetUnfolder]: 4963/9905 cut-off events. [2022-12-13 11:46:54,808 INFO L131 PetriNetUnfolder]: For 8238/8808 co-relation queries the response was YES. [2022-12-13 11:46:54,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30229 conditions, 9905 events. 4963/9905 cut-off events. For 8238/8808 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 93686 event pairs, 464 based on Foata normal form. 50/4854 useless extension candidates. Maximal degree in co-relation 30210. Up to 6616 conditions per place. [2022-12-13 11:46:54,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 89 transitions, 517 flow [2022-12-13 11:46:54,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-13 11:46:55,041 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:55,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 928 [2022-12-13 11:46:55,042 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 89 transitions, 517 flow [2022-12-13 11:46:55,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:55,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:55,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:55,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:46:55,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2057141221, now seen corresponding path program 1 times [2022-12-13 11:46:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:55,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428695961] [2022-12-13 11:46:55,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:55,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428695961] [2022-12-13 11:46:55,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428695961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:55,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:55,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:46:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152234585] [2022-12-13 11:46:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:55,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:46:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:46:55,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:46:55,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2022-12-13 11:46:55,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 89 transitions, 517 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:55,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:55,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2022-12-13 11:46:55,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:58,625 INFO L130 PetriNetUnfolder]: 18268/31019 cut-off events. [2022-12-13 11:46:58,626 INFO L131 PetriNetUnfolder]: For 46599/50059 co-relation queries the response was YES. [2022-12-13 11:46:58,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114160 conditions, 31019 events. 18268/31019 cut-off events. For 46599/50059 co-relation queries the response was YES. Maximal size of possible extension queue 2409. Compared 275476 event pairs, 1637 based on Foata normal form. 1485/25068 useless extension candidates. Maximal degree in co-relation 114138. Up to 16223 conditions per place. [2022-12-13 11:46:58,762 INFO L137 encePairwiseOnDemand]: 34/41 looper letters, 168 selfloop transitions, 19 changer transitions 17/235 dead transitions. [2022-12-13 11:46:58,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 235 transitions, 1778 flow [2022-12-13 11:46:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:46:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 11:46:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2022-12-13 11:46:58,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5780487804878048 [2022-12-13 11:46:58,764 INFO L175 Difference]: Start difference. First operand has 68 places, 89 transitions, 517 flow. Second operand 10 states and 237 transitions. [2022-12-13 11:46:58,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 235 transitions, 1778 flow [2022-12-13 11:46:59,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 235 transitions, 1774 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 11:46:59,025 INFO L231 Difference]: Finished difference. Result has 80 places, 101 transitions, 635 flow [2022-12-13 11:46:59,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=635, PETRI_PLACES=80, PETRI_TRANSITIONS=101} [2022-12-13 11:46:59,026 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2022-12-13 11:46:59,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:59,026 INFO L89 Accepts]: Start accepts. Operand has 80 places, 101 transitions, 635 flow [2022-12-13 11:46:59,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:59,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:59,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 101 transitions, 635 flow [2022-12-13 11:46:59,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 101 transitions, 635 flow [2022-12-13 11:47:00,103 INFO L130 PetriNetUnfolder]: 8816/16800 cut-off events. [2022-12-13 11:47:00,104 INFO L131 PetriNetUnfolder]: For 16288/17147 co-relation queries the response was YES. [2022-12-13 11:47:00,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55617 conditions, 16800 events. 8816/16800 cut-off events. For 16288/17147 co-relation queries the response was YES. Maximal size of possible extension queue 2484. Compared 169177 event pairs, 815 based on Foata normal form. 60/8598 useless extension candidates. Maximal degree in co-relation 55593. Up to 11449 conditions per place. [2022-12-13 11:47:00,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 101 transitions, 635 flow [2022-12-13 11:47:00,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 2012 [2022-12-13 11:47:01,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L2-1-->L889: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_30 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_32 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse1 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd0~0_31 (ite .cse1 0 v_~z$r_buff0_thd0~0_32)) (= v_~z~0_106 (ite .cse0 v_~z$w_buff0~0_76 (ite .cse2 v_~z$w_buff1~0_71 v_~z~0_107))) (= v_~z$r_buff1_thd0~0_29 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_31 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_126 256) 0)))) 0 v_~z$r_buff1_thd0~0_30)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_127) v_~z$w_buff1_used~0_126)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_107} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_106} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [564] $Ultimate##0-->L844: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_114 256) 0))) (.cse1 (= (mod v_~z$w_buff0_used~0_347 256) 0))) (and (= |v_P3Thread1of1ForFork2_#t~nondet6#1_26| v_~weak$$choice2~0_114) (= v_~z$flush_delayed~0_100 0) (= v_~z$mem_tmp~0_78 v_~z~0_276) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36| 0)) (= v_~z$w_buff1_used~0_304 (ite .cse0 v_~z$w_buff0_used~0_349 (ite .cse1 v_~z$w_buff0_used~0_349 0))) (= v_~z$r_buff0_thd2~0_50 v_~z$r_buff1_thd2~0_46) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~z$r_buff0_thd4~0_180) (= v_~z$r_buff0_thd3~0_130 v_~z$r_buff1_thd3~0_128) (= v_~__unbuffered_p3_EAX~0_164 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36| (ite (= (mod v_~z$w_buff0_used~0_349 256) 0) 1 0)) (= v_~z$w_buff0~0_214 1) (= (ite .cse0 v_~z$mem_tmp~0_78 v_~__unbuffered_p3_EAX~0_164) v_~z~0_275) (= v_~z$w_buff0_used~0_347 (ite .cse0 1 0)) (= |v_P3Thread1of1ForFork2_~arg#1.base_34| |v_P3Thread1of1ForFork2_#in~arg#1.base_34|) (= (ite .cse0 v_~z$r_buff0_thd4~0_182 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd4~0_180 256) 0))) (or .cse1 (and (= (mod v_~z$r_buff0_thd4~0_182 256) 0) .cse2) (and (= (mod v_~z$w_buff1_used~0_304 256) 0) .cse2))) v_~z$r_buff0_thd4~0_182 0)) v_~z$r_buff1_thd4~0_148) (= v_~z$r_buff0_thd1~0_50 v_~z$r_buff1_thd1~0_50) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_26| v_~weak$$choice0~0_64) (= |v_P3Thread1of1ForFork2_~arg#1.offset_34| |v_P3Thread1of1ForFork2_#in~arg#1.offset_34|) (= v_~z$r_buff0_thd0~0_150 v_~z$r_buff1_thd0~0_152) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|) (= v_~z$w_buff0~0_216 v_~z$w_buff1~0_192))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_26|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_150, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_349, ~z$w_buff0~0=v_~z$w_buff0~0_216, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_182, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~z~0=v_~z~0_276, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_26|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_148, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_46, ~z$w_buff1~0=v_~z$w_buff1~0_192, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_150, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_152, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_164, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_180, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ~z$mem_tmp~0=v_~z$mem_tmp~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_128, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ~z$flush_delayed~0=v_~z$flush_delayed~0_100, ~weak$$choice0~0=v_~weak$$choice0~0_64, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_34|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~z~0=v_~z~0_275, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_50} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_#t~nondet5#1, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:47:01,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L2-1-->L889: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_30 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_32 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse1 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd0~0_31 (ite .cse1 0 v_~z$r_buff0_thd0~0_32)) (= v_~z~0_106 (ite .cse0 v_~z$w_buff0~0_76 (ite .cse2 v_~z$w_buff1~0_71 v_~z~0_107))) (= v_~z$r_buff1_thd0~0_29 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_31 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_126 256) 0)))) 0 v_~z$r_buff1_thd0~0_30)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_127) v_~z$w_buff1_used~0_126)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_107} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_106} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [565] $Ultimate##0-->L844: Formula: (let ((.cse1 (= (mod v_~z$w_buff0_used~0_353 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_116 256) 0)))) (and (= |v_P3Thread1of1ForFork2_#t~nondet6#1_30| v_~weak$$choice2~0_116) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38| 0)) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_30| v_~weak$$choice0~0_66) (= v_~z$r_buff0_thd3~0_132 v_~z$r_buff1_thd3~0_130) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~z$r_buff0_thd4~0_186) (= |v_P3Thread1of1ForFork2_~arg#1.offset_36| |v_P3Thread1of1ForFork2_#in~arg#1.offset_36|) (= v_~z$w_buff0~0_220 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|) (= v_~__unbuffered_p3_EAX~0_166 1) (= v_~z$flush_delayed~0_102 0) (= v_~z$w_buff1_used~0_308 (ite .cse0 v_~z$w_buff0_used~0_355 (ite .cse1 v_~z$w_buff0_used~0_355 0))) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_48) (= (ite (= (mod v_~z$w_buff0_used~0_355 256) 0) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38|) (= (ite .cse0 v_~z$r_buff0_thd4~0_188 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd4~0_186 256) 0))) (or .cse1 (and .cse2 (= (mod v_~z$r_buff0_thd4~0_188 256) 0)) (and .cse2 (= (mod v_~z$w_buff1_used~0_308 256) 0)))) v_~z$r_buff0_thd4~0_188 0)) v_~z$r_buff1_thd4~0_152) (= v_~z$w_buff0_used~0_353 (ite .cse0 1 0)) (= v_~z$w_buff0~0_222 v_~z$w_buff1~0_196) (= v_~z$r_buff0_thd0~0_152 v_~z$r_buff1_thd0~0_154) (= v_~z$r_buff0_thd1~0_52 v_~z$r_buff1_thd1~0_52) (= v_~z~0_279 (ite .cse0 v_~z$mem_tmp~0_80 v_~__unbuffered_p3_EAX~0_166)) (= v_~z$mem_tmp~0_80 v_~z~0_280) (= |v_P3Thread1of1ForFork2_~arg#1.base_36| |v_P3Thread1of1ForFork2_#in~arg#1.base_36|))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_30|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_152, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_355, ~z$w_buff0~0=v_~z$w_buff0~0_222, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_36|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_188, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_132, ~z~0=v_~z~0_280, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_30|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_152, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_48, ~z$w_buff1~0=v_~z$w_buff1~0_196, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_152, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_36|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_154, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_166, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_186, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_80, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_353, ~z$w_buff0~0=v_~z$w_buff0~0_220, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_130, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ~z$flush_delayed~0=v_~z$flush_delayed~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_66, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_36|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_52, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_36|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_132, ~z~0=v_~z~0_279, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_#t~nondet5#1, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:47:01,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L2-1-->L844: Formula: (let ((.cse6 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse4 (and (not (= (mod v_~z$w_buff0_used~0_367 256) 0)) .cse6))) (let ((.cse1 (ite .cse4 0 v_~z$w_buff0_used~0_367))) (let ((.cse2 (= (mod v_~z$w_buff0_used~0_365 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_120 256) 0))) (.cse5 (= (mod .cse1 256) 0))) (and (= v_~z$w_buff1_used~0_318 (ite .cse0 .cse1 (ite .cse2 .cse1 0))) (= v_~z$r_buff0_thd2~0_56 v_~z$r_buff1_thd2~0_52) (= v_~z$flush_delayed~0_106 0) (= v_~z$r_buff0_thd1~0_56 v_~z$r_buff1_thd1~0_56) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_42| 0)) (= v_~z$w_buff0~0_230 1) (= (ite .cse0 v_~z$r_buff0_thd4~0_197 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd4~0_196 256) 0))) (or (and (= (mod v_~z$r_buff0_thd4~0_197 256) 0) .cse3) .cse2 (and (= (mod v_~z$w_buff1_used~0_318 256) 0) .cse3))) v_~z$r_buff0_thd4~0_197 0)) v_~z$r_buff1_thd4~0_158) (= v_~z$r_buff0_thd0~0_158 v_~z$r_buff1_thd0~0_162) (= |v_P3Thread1of1ForFork2_~arg#1.base_40| |v_P3Thread1of1ForFork2_#in~arg#1.base_40|) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_38| v_~weak$$choice0~0_70) (= v_~z$mem_tmp~0_84 (ite .cse4 v_~z$w_buff0~0_231 (ite (and (not (= (mod v_~z$w_buff1_used~0_320 256) 0)) (not (= (mod v_~z$r_buff1_thd0~0_164 256) 0))) v_~z$w_buff1~0_205 v_~z~0_291))) (= v_~z$w_buff0_used~0_365 (ite .cse0 1 0)) (= v_~z$r_buff0_thd3~0_136 v_~z$r_buff1_thd3~0_134) (= (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1))) v_~z$r_buff0_thd4~0_196) (= v_~z$w_buff0~0_231 v_~z$w_buff1~0_204) (= |v_P3Thread1of1ForFork2_~arg#1.offset_40| |v_P3Thread1of1ForFork2_#in~arg#1.offset_40|) (= v_~__unbuffered_p3_EAX~0_170 1) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_38| v_~weak$$choice2~0_120) (= v_~z~0_289 (ite .cse0 v_~z$mem_tmp~0_84 v_~__unbuffered_p3_EAX~0_170)) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_42| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_42|) (= v_~z$r_buff0_thd0~0_158 (ite (and (not .cse5) .cse6) 0 v_~z$r_buff0_thd0~0_159)) (= (ite .cse5 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_42|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_367, ~z$w_buff0~0=v_~z$w_buff0~0_231, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_40|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_320, ~z$w_buff1~0=v_~z$w_buff1~0_205, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_38|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_164, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_40|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_197, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~z~0=v_~z~0_291, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_56} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_158, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_204, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_42|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_42|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_196, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_56, ~z$mem_tmp~0=v_~z$mem_tmp~0_84, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_365, ~z$w_buff0~0=v_~z$w_buff0~0_230, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_318, ~z$flush_delayed~0=v_~z$flush_delayed~0_106, ~weak$$choice0~0=v_~weak$$choice0~0_70, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_56, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_40|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~z~0=v_~z~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_56} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_#t~nondet5#1, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] and [525] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~__unbuffered_p0_EAX~0_43 0) (= v_~__unbuffered_p1_EAX~0_38 1) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~__unbuffered_p3_EAX~0_50 1) (= v_~__unbuffered_p2_EAX~0_54 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0] [2022-12-13 11:47:02,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [568] L2-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff0_thd0~0_163 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff0_used~0_372 256) 0)) .cse4))) (let ((.cse1 (ite .cse3 0 v_~z$w_buff0_used~0_372))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_122 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_371 256) 0)) (.cse5 (= (mod .cse1 256) 0))) (and (= |v_P3Thread1of1ForFork2_~arg#1.offset_42| |v_P3Thread1of1ForFork2_#in~arg#1.offset_42|) (= v_~z$w_buff0_used~0_371 (ite .cse0 1 0)) (= v_~z$w_buff0~0_234 1) (= v_~z$w_buff1_used~0_324 (ite .cse0 .cse1 (ite .cse2 .cse1 0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_127|) (= v_~z$w_buff0~0_235 v_~z$w_buff1~0_208) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_42| v_~weak$$choice2~0_122) (= v_~z$r_buff0_thd1~0_58 v_~z$r_buff1_thd1~0_58) (= v_~z$flush_delayed~0_108 0) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_44| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_44|) (= v_~z$r_buff0_thd3~0_138 v_~z$r_buff1_thd3~0_136) (= (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1))) v_~z$r_buff0_thd4~0_200) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_127| 0) (= v_~main$tmp_guard1~0_160 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_154 1) (= v_~__unbuffered_p3_EAX~0_172 1) (= v_~__unbuffered_p2_EAX~0_182 0) (= v_~__unbuffered_p0_EAX~0_177 0) (= v_~__unbuffered_p1_EBX~0_158 0) (= v_~__unbuffered_p3_EBX~0_159 0))) 1 0) 0) 0 1)) (= v_~z$mem_tmp~0_86 (ite .cse3 v_~z$w_buff0~0_235 (ite (and (not (= (mod v_~z$r_buff1_thd0~0_169 256) 0)) (not (= (mod v_~z$w_buff1_used~0_325 256) 0))) v_~z$w_buff1~0_209 v_~z~0_296))) (= v_~z~0_295 (ite .cse0 v_~z$mem_tmp~0_86 v_~__unbuffered_p3_EAX~0_172)) (= |v_P3Thread1of1ForFork2_~arg#1.base_42| |v_P3Thread1of1ForFork2_#in~arg#1.base_42|) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_42| v_~weak$$choice0~0_72) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_44| 0)) (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff1_thd2~0_54) (= v_~z$r_buff0_thd0~0_162 (ite (and .cse4 (not .cse5)) 0 v_~z$r_buff0_thd0~0_163)) (= (ite .cse0 v_~z$r_buff0_thd4~0_201 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd4~0_200 256) 0))) (or (and .cse6 (= (mod v_~z$r_buff0_thd4~0_201 256) 0)) (and (= (mod v_~z$w_buff1_used~0_324 256) 0) .cse6) .cse2)) v_~z$r_buff0_thd4~0_201 0)) v_~z$r_buff1_thd4~0_160) (= (ite .cse5 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_44|) (= v_~z$r_buff0_thd0~0_162 v_~z$r_buff1_thd0~0_168) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_160 256))))))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_158, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_372, ~z$w_buff0~0=v_~z$w_buff0~0_235, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_325, ~z$w_buff1~0=v_~z$w_buff1~0_209, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_159, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_42|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_154, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_169, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_42|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_201, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_182, ~z~0=v_~z~0_296, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_127|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~z$w_buff1~0=v_~z$w_buff1~0_208, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_160, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_44|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_162, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_154, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_168, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_172, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_200, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_182, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, ~z$mem_tmp~0=v_~z$mem_tmp~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_158, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_371, ~z$w_buff0~0=v_~z$w_buff0~0_234, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_324, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_159, ~z$flush_delayed~0=v_~z$flush_delayed~0_108, ~weak$$choice0~0=v_~weak$$choice0~0_72, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_42|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_42|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_122, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$r_buff1_thd2~0, ~z$w_buff1~0, ~main$tmp_guard1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2_#t~nondet6#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_#t~nondet5#1, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, ~z~0, ~weak$$choice2~0] and [391] L775-->L778: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-13 11:47:02,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L828-->L844: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_63 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse3 (and .cse10 .cse6))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_111 0))) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p3_EAX~0_14) v_~z~0_94) (= v_~z$mem_tmp~0_30 v_~z~0_95) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_1| v_~weak$$choice0~0_14) (= v_~z$w_buff0~0_59 v_~z$w_buff0~0_58) (= v_~__unbuffered_p3_EAX~0_14 (ite .cse4 v_~z~0_95 (ite .cse5 v_~z$w_buff0~0_59 v_~z$w_buff1~0_58))) (= v_~z$r_buff0_thd4~0_62 (ite .cse0 v_~z$r_buff0_thd4~0_63 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~z$r_buff0_thd4~0_63 (ite (and (not .cse2) .cse8) 0 v_~z$r_buff0_thd4~0_63)))) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse4 v_~z$w_buff0_used~0_124 (ite .cse5 0 v_~z$w_buff0_used~0_124)))) (= v_~z$r_buff1_thd4~0_59 (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_62 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~z$r_buff1_thd4~0_60 0))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_59, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_58, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_62, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] and [391] L775-->L778: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-13 11:47:03,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] $Ultimate##0-->L828: Formula: (and (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff1_thd3~0_61) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_157 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_157 1) (= v_~z$w_buff0~0_86 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_87 v_~z$w_buff1~0_79) (= v_~z$r_buff0_thd4~0_82 1) (= v_~z$r_buff0_thd0~0_39 v_~z$r_buff1_thd0~0_37) (= v_~z$r_buff0_thd4~0_83 v_~z$r_buff1_thd4~0_73) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_138) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd2~0_17 v_~z$r_buff1_thd2~0_17)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_87, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_79, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_37, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] and [421] L2-1-->L889: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_30 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_32 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse1 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd0~0_31 (ite .cse1 0 v_~z$r_buff0_thd0~0_32)) (= v_~z~0_106 (ite .cse0 v_~z$w_buff0~0_76 (ite .cse2 v_~z$w_buff1~0_71 v_~z~0_107))) (= v_~z$r_buff1_thd0~0_29 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_31 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_126 256) 0)))) 0 v_~z$r_buff1_thd0~0_30)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_127) v_~z$w_buff1_used~0_126)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_107} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_106} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 11:47:05,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L878-3-->L2-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= v_~__unbuffered_cnt~0_In_1 4) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [572] $Ultimate##0-->L889: Formula: (let ((.cse3 (= (mod v_~z$w_buff0_used~0_399 256) 0)) (.cse0 (not (= (mod v_~z$w_buff0_used~0_397 256) 0))) (.cse1 (not (= (mod v_~z$r_buff0_thd0~0_176 256) 0)))) (let ((.cse2 (and .cse0 .cse1)) (.cse4 (and (not .cse3) .cse1))) (and (= v_~z$w_buff0~0_260 1) (= v_~z$r_buff1_thd0~0_181 (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd0~0_175 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_346 256) 0)) .cse1)) 0 v_~z$r_buff0_thd0~0_176)) (= v_~z$r_buff0_thd0~0_175 (ite .cse2 0 v_~z$r_buff0_thd0~0_176)) (= (ite .cse3 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|) (= v_~z$r_buff0_thd3~0_151 v_~z$r_buff1_thd3~0_150) (= |v_P3Thread1of1ForFork2_~arg#1.base_51| |v_P3Thread1of1ForFork2_#in~arg#1.base_51|) (= v_~z$r_buff0_thd4~0_226 v_~z$r_buff1_thd4~0_175) (= v_~z~0_318 (ite .cse1 v_~z$w_buff0~0_260 (ite .cse4 v_~z$w_buff1~0_230 v_~z~0_319))) (= v_~z$r_buff0_thd2~0_67 v_~z$r_buff1_thd2~0_63) (= |v_P3Thread1of1ForFork2_~arg#1.offset_51| |v_P3Thread1of1ForFork2_#in~arg#1.offset_51|) (= v_~z$r_buff0_thd4~0_225 1) (= v_~z$w_buff1_used~0_346 (ite (or .cse2 .cse4) 0 v_~z$w_buff0_used~0_399)) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_53| 0)) (= v_~z$w_buff0_used~0_397 (ite .cse1 0 1)) (= v_~z$r_buff0_thd1~0_67 v_~z$r_buff1_thd1~0_67) (= v_~z$w_buff0~0_261 v_~z$w_buff1~0_230) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_176, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_261, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_51|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_51|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_226, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_151, ~z~0=v_~z~0_319, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_67} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_397, ~z$w_buff0~0=v_~z$w_buff0~0_260, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_150, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_51|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_346, ~z$w_buff1~0=v_~z$w_buff1~0_230, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_175, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_51|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_51|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_51|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_225, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_151, ~z~0=v_~z~0_318, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_67} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z~0] [2022-12-13 11:47:06,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L878-3-->L889: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_437 256) 0))) (.cse2 (not (= (mod v_~z$r_buff0_thd0~0_202 256) 0))) (.cse0 (= (mod v_~z$w_buff0_used~0_438 256) 0))) (let ((.cse3 (and .cse2 (not .cse0))) (.cse1 (and .cse2 .cse4))) (and (= v_~z$w_buff0~0_297 v_~z$w_buff1~0_258) (= v_~z$w_buff0~0_296 1) (= v_~z$r_buff0_thd3~0_165 v_~z$r_buff1_thd3~0_164) (= v_~z$r_buff0_thd4~0_259 1) (= v_~z$r_buff0_thd4~0_260 v_~z$r_buff1_thd4~0_195) (= v_~z$r_buff0_thd1~0_81 v_~z$r_buff1_thd1~0_81) (= |v_P3Thread1of1ForFork2_~arg#1.base_65| |v_P3Thread1of1ForFork2_#in~arg#1.base_65|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67| (ite .cse0 1 0)) (= v_~z$r_buff0_thd2~0_81 v_~z$r_buff1_thd2~0_77) (= |v_P3Thread1of1ForFork2_~arg#1.offset_65| |v_P3Thread1of1ForFork2_#in~arg#1.offset_65|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_67|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_683 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_130) (= v_~z$r_buff0_thd0~0_201 (ite .cse1 0 v_~z$r_buff0_thd0~0_202)) (= v_~z~0_350 (ite .cse2 v_~z$w_buff0~0_296 (ite .cse3 v_~z$w_buff1~0_258 v_~z~0_351))) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_67| 0)) (= (ite (or .cse3 .cse1) 0 v_~z$w_buff0_used~0_438) v_~z$w_buff1_used~0_378) (= v_~z$r_buff1_thd0~0_207 (ite (or (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_201 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_378 256) 0)) .cse2)) 0 v_~z$r_buff0_thd0~0_202)) (= (mod v_~main$tmp_guard0~0_130 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~z$w_buff0_used~0_437 (ite .cse2 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_202, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_438, ~z$w_buff0~0=v_~z$w_buff0~0_297, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_65|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_65|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_260, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_165, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_683, ~z~0=v_~z~0_351, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_81, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_81} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_113|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_195, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_65|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_77, ~z$w_buff1~0=v_~z$w_buff1~0_258, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_201, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_65|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_207, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_259, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_437, ~z$w_buff0~0=v_~z$w_buff0~0_296, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_164, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_378, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_130, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_129|, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_65|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_81, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_65|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_165, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_683, ~z~0=v_~z~0_350, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_81, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [404] L828-->L844: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_63 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse3 (and .cse10 .cse6))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_111 0))) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p3_EAX~0_14) v_~z~0_94) (= v_~z$mem_tmp~0_30 v_~z~0_95) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_1| v_~weak$$choice0~0_14) (= v_~z$w_buff0~0_59 v_~z$w_buff0~0_58) (= v_~__unbuffered_p3_EAX~0_14 (ite .cse4 v_~z~0_95 (ite .cse5 v_~z$w_buff0~0_59 v_~z$w_buff1~0_58))) (= v_~z$r_buff0_thd4~0_62 (ite .cse0 v_~z$r_buff0_thd4~0_63 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~z$r_buff0_thd4~0_63 (ite (and (not .cse2) .cse8) 0 v_~z$r_buff0_thd4~0_63)))) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse4 v_~z$w_buff0_used~0_124 (ite .cse5 0 v_~z$w_buff0_used~0_124)))) (= v_~z$r_buff1_thd4~0_59 (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_62 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~z$r_buff1_thd4~0_60 0))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_59, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_58, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_62, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:47:06,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L878-3-->L889: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_437 256) 0))) (.cse2 (not (= (mod v_~z$r_buff0_thd0~0_202 256) 0))) (.cse0 (= (mod v_~z$w_buff0_used~0_438 256) 0))) (let ((.cse3 (and .cse2 (not .cse0))) (.cse1 (and .cse2 .cse4))) (and (= v_~z$w_buff0~0_297 v_~z$w_buff1~0_258) (= v_~z$w_buff0~0_296 1) (= v_~z$r_buff0_thd3~0_165 v_~z$r_buff1_thd3~0_164) (= v_~z$r_buff0_thd4~0_259 1) (= v_~z$r_buff0_thd4~0_260 v_~z$r_buff1_thd4~0_195) (= v_~z$r_buff0_thd1~0_81 v_~z$r_buff1_thd1~0_81) (= |v_P3Thread1of1ForFork2_~arg#1.base_65| |v_P3Thread1of1ForFork2_#in~arg#1.base_65|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67| (ite .cse0 1 0)) (= v_~z$r_buff0_thd2~0_81 v_~z$r_buff1_thd2~0_77) (= |v_P3Thread1of1ForFork2_~arg#1.offset_65| |v_P3Thread1of1ForFork2_#in~arg#1.offset_65|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_67|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_683 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_130) (= v_~z$r_buff0_thd0~0_201 (ite .cse1 0 v_~z$r_buff0_thd0~0_202)) (= v_~z~0_350 (ite .cse2 v_~z$w_buff0~0_296 (ite .cse3 v_~z$w_buff1~0_258 v_~z~0_351))) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_67| 0)) (= (ite (or .cse3 .cse1) 0 v_~z$w_buff0_used~0_438) v_~z$w_buff1_used~0_378) (= v_~z$r_buff1_thd0~0_207 (ite (or (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_201 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_378 256) 0)) .cse2)) 0 v_~z$r_buff0_thd0~0_202)) (= (mod v_~main$tmp_guard0~0_130 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~z$w_buff0_used~0_437 (ite .cse2 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_202, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_438, ~z$w_buff0~0=v_~z$w_buff0~0_297, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_65|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_65|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_260, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_165, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_683, ~z~0=v_~z~0_351, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_81, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_81} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_113|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_195, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_65|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_77, ~z$w_buff1~0=v_~z$w_buff1~0_258, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_201, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_65|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_207, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_259, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_437, ~z$w_buff0~0=v_~z$w_buff0~0_296, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_164, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_378, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_130, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_129|, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_65|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_81, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_65|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_165, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_683, ~z~0=v_~z~0_350, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_81, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [570] L828-->L778: Formula: (let ((.cse4 (= 0 (mod v_~z$r_buff1_thd4~0_165 256))) (.cse6 (= (mod v_~z$r_buff0_thd4~0_209 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_333 256) 0) .cse6)) (.cse5 (and .cse4 .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_380 256) 0))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_332 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_379 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_126 256) 0))) (.cse8 (or .cse10 .cse5 .cse11)) (.cse9 (and .cse7 (not .cse11)))) (and (= v_~z~0_303 (ite .cse0 v_~z$mem_tmp~0_90 v_~__unbuffered_p3_EAX~0_176)) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_50| v_~weak$$choice2~0_126) (= v_~z$r_buff1_thd4~0_164 (ite .cse0 v_~z$r_buff1_thd4~0_165 (ite (let ((.cse1 (= (mod v_~z$r_buff0_thd4~0_208 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~z$r_buff1_thd4~0_165 0))) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_50| v_~weak$$choice0~0_76) (= v_~z$w_buff1~0_217 v_~z$w_buff1~0_216) (= v_~z$mem_tmp~0_90 v_~z~0_304) (= (ite .cse0 v_~z$r_buff0_thd4~0_209 (ite (or .cse3 .cse5 (and .cse6 .cse2)) v_~z$r_buff0_thd4~0_209 (ite (and .cse7 (not .cse3)) 0 v_~z$r_buff0_thd4~0_209))) v_~z$r_buff0_thd4~0_208) (= (ite .cse8 v_~z~0_304 (ite .cse9 v_~z$w_buff0~0_243 v_~z$w_buff1~0_217)) v_~__unbuffered_p3_EAX~0_176) (= (ite .cse0 v_~z$w_buff1_used~0_333 (ite (or .cse10 .cse3 .cse5) v_~z$w_buff1_used~0_333 0)) v_~z$w_buff1_used~0_332) (= v_~y~0_49 v_~__unbuffered_p1_EBX~0_164) (= v_~z$w_buff0_used~0_379 (ite .cse0 v_~z$w_buff0_used~0_380 (ite .cse8 v_~z$w_buff0_used~0_380 (ite .cse9 0 v_~z$w_buff0_used~0_380)))) (= v_~z$w_buff0~0_243 v_~z$w_buff0~0_242) (= v_~z$flush_delayed~0_112 0))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_50|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_165, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_380, ~z$w_buff0~0=v_~z$w_buff0~0_243, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_333, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_209, ~z$w_buff1~0=v_~z$w_buff1~0_217, ~z~0=v_~z~0_304, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_50|, ~y~0=v_~y~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_164, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_379, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_332, ~z$w_buff1~0=v_~z$w_buff1~0_216, ~z$flush_delayed~0=v_~z$flush_delayed~0_112, ~weak$$choice0~0=v_~weak$$choice0~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_176, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_208, ~z~0=v_~z~0_303, ~y~0=v_~y~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_126} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:47:07,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] L878-3-->L844: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff0_thd0~0_206 256) 0)))) (let ((.cse10 (ite .cse4 0 1))) (let ((.cse7 (= (mod .cse10 256) 0))) (let ((.cse6 (= (mod v_~z$w_buff0_used~0_443 256) 0)) (.cse3 (not .cse7))) (let ((.cse9 (and .cse3 .cse4)) (.cse5 (and (not .cse6) .cse4))) (let ((.cse1 (ite (or .cse9 .cse5) 0 v_~z$w_buff0_used~0_443)) (.cse2 (= (mod v_~z$w_buff0_used~0_441 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_145 256) 0)))) (and (= |v_P3Thread1of1ForFork2_~arg#1.base_67| |v_P3Thread1of1ForFork2_#in~arg#1.base_67|) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_82| v_~weak$$choice0~0_95) (= v_~z$w_buff1_used~0_380 (ite .cse0 .cse1 (ite .cse2 .cse1 0))) (= v_~z$w_buff0~0_302 v_~z$w_buff1~0_260) (= v_~z$r_buff1_thd0~0_209 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_205 256) 0)) .cse3) (and .cse4 (not (= (mod .cse1 256) 0)))) 0 v_~z$r_buff0_thd0~0_206)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (mod v_~main$tmp_guard0~0_132 256)) (= (ite .cse4 v_~z$w_buff0~0_300 (ite .cse5 v_~z$w_buff0~0_302 v_~z~0_356)) v_~z$mem_tmp~0_109) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_69| 0)) (= (ite .cse6 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_69|) (= |v_P3Thread1of1ForFork2_~arg#1.offset_67| |v_P3Thread1of1ForFork2_#in~arg#1.offset_67|) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_82| v_~weak$$choice2~0_145) (= v_~z$r_buff0_thd2~0_83 v_~z$r_buff1_thd2~0_79) (= (ite .cse0 v_~z$mem_tmp~0_109 v_~__unbuffered_p3_EAX~0_194) v_~z~0_354) (= (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1))) v_~z$r_buff0_thd4~0_263) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= (ite .cse7 v_~z$mem_tmp~0_109 (ite .cse3 v_~z$w_buff0~0_300 v_~z$w_buff0~0_302)) v_~__unbuffered_p3_EAX~0_194) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_69| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_69|) (= v_~z$r_buff0_thd1~0_83 v_~z$r_buff1_thd1~0_83) (= (ite .cse0 v_~z$r_buff0_thd4~0_265 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd4~0_263 256) 0))) (or (and (= (mod v_~z$r_buff0_thd4~0_265 256) 0) .cse8) .cse2 (and (= (mod v_~z$w_buff1_used~0_380 256) 0) .cse8))) v_~z$r_buff0_thd4~0_265 0)) v_~z$r_buff1_thd4~0_197) (= (ite (= (ite (= v_~__unbuffered_cnt~0_685 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_132) (= v_~z$r_buff0_thd0~0_205 (ite .cse9 0 v_~z$r_buff0_thd0~0_206)) (= (ite .cse0 .cse10 (ite .cse7 .cse10 (ite .cse3 0 .cse10))) v_~z$w_buff0_used~0_441) (= v_~z$w_buff0~0_300 1) (= v_~z$r_buff0_thd3~0_167 v_~z$r_buff1_thd3~0_166) (= v_~z$flush_delayed~0_131 0)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_443, ~z$w_buff0~0=v_~z$w_buff0~0_302, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_67|, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_82|, P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_206, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_67|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_265, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_685, ~z~0=v_~z~0_356, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_83, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_83} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_115|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_197, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_67|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_79, ~z$w_buff1~0=v_~z$w_buff1~0_260, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_69|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_69|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_205, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_67|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_194, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_263, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_83, ~z$mem_tmp~0=v_~z$mem_tmp~0_109, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_441, ~z$w_buff0~0=v_~z$w_buff0~0_300, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_166, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_380, ~z$flush_delayed~0=v_~z$flush_delayed~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_131|, ~weak$$choice0~0=v_~weak$$choice0~0_95, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_67|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_67|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_685, ~z~0=v_~z~0_354, ~weak$$choice2~0=v_~weak$$choice2~0_145, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~z$r_buff1_thd4~0, ~z$r_buff1_thd2~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2_#t~nondet6#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_#t~nondet5#1, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, ~z$r_buff1_thd1~0, ~z~0, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [525] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~__unbuffered_p0_EAX~0_43 0) (= v_~__unbuffered_p1_EAX~0_38 1) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~__unbuffered_p3_EAX~0_50 1) (= v_~__unbuffered_p2_EAX~0_54 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0] [2022-12-13 11:47:08,047 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 11:47:08,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9022 [2022-12-13 11:47:08,048 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 98 transitions, 698 flow [2022-12-13 11:47:08,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:08,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:08,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:47:08,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1492677399, now seen corresponding path program 1 times [2022-12-13 11:47:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:08,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3000579] [2022-12-13 11:47:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:08,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3000579] [2022-12-13 11:47:08,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3000579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:08,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:08,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618854235] [2022-12-13 11:47:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:08,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:47:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:47:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:47:08,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2022-12-13 11:47:08,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 98 transitions, 698 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:08,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:08,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2022-12-13 11:47:08,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:11,904 INFO L130 PetriNetUnfolder]: 28256/45610 cut-off events. [2022-12-13 11:47:11,904 INFO L131 PetriNetUnfolder]: For 101130/105460 co-relation queries the response was YES. [2022-12-13 11:47:12,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184323 conditions, 45610 events. 28256/45610 cut-off events. For 101130/105460 co-relation queries the response was YES. Maximal size of possible extension queue 3299. Compared 388121 event pairs, 3056 based on Foata normal form. 2613/37645 useless extension candidates. Maximal degree in co-relation 184296. Up to 24741 conditions per place. [2022-12-13 11:47:12,142 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 121 selfloop transitions, 10 changer transitions 33/185 dead transitions. [2022-12-13 11:47:12,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 185 transitions, 1459 flow [2022-12-13 11:47:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-12-13 11:47:12,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2022-12-13 11:47:12,144 INFO L175 Difference]: Start difference. First operand has 77 places, 98 transitions, 698 flow. Second operand 6 states and 149 transitions. [2022-12-13 11:47:12,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 185 transitions, 1459 flow [2022-12-13 11:47:13,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 185 transitions, 1426 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 11:47:13,411 INFO L231 Difference]: Finished difference. Result has 79 places, 92 transitions, 598 flow [2022-12-13 11:47:13,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=79, PETRI_TRANSITIONS=92} [2022-12-13 11:47:13,412 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2022-12-13 11:47:13,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:13,412 INFO L89 Accepts]: Start accepts. Operand has 79 places, 92 transitions, 598 flow [2022-12-13 11:47:13,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:13,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:13,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 92 transitions, 598 flow [2022-12-13 11:47:13,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 92 transitions, 598 flow [2022-12-13 11:47:14,628 INFO L130 PetriNetUnfolder]: 12055/21919 cut-off events. [2022-12-13 11:47:14,628 INFO L131 PetriNetUnfolder]: For 20877/24232 co-relation queries the response was YES. [2022-12-13 11:47:14,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73434 conditions, 21919 events. 12055/21919 cut-off events. For 20877/24232 co-relation queries the response was YES. Maximal size of possible extension queue 3726. Compared 222339 event pairs, 1180 based on Foata normal form. 91/10189 useless extension candidates. Maximal degree in co-relation 73410. Up to 17173 conditions per place. [2022-12-13 11:47:14,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 92 transitions, 598 flow [2022-12-13 11:47:14,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 1792 [2022-12-13 11:47:15,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] $Ultimate##0-->L790: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_8 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [574] $Ultimate##0-->L844: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_135 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_409 256) 0))) (and (= v_~__unbuffered_p3_EAX~0_184 1) (= v_~z$r_buff0_thd0~0_181 v_~z$r_buff1_thd0~0_187) (= (ite .cse0 v_~z$r_buff0_thd4~0_237 (ite (let ((.cse1 (= (mod v_~z$r_buff0_thd4~0_235 256) 0))) (or (and .cse1 (= (mod v_~z$w_buff1_used~0_354 256) 0)) .cse2 (and (= (mod v_~z$r_buff0_thd4~0_237 256) 0) .cse1))) v_~z$r_buff0_thd4~0_237 0)) v_~z$r_buff1_thd4~0_181) (= (ite .cse0 1 0) v_~z$w_buff0_used~0_409) (= v_~z$mem_tmp~0_99 v_~z~0_327) (= v_~z$w_buff0~0_272 v_~z$w_buff1~0_236) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_62| v_~weak$$choice2~0_135) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_67) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_57| 0)) (= v_~z$flush_delayed~0_121 0) (= v_~z$r_buff0_thd3~0_155 v_~z$r_buff1_thd3~0_154) (= v_~z$w_buff0~0_270 1) (= v_~z$r_buff0_thd1~0_71 v_~z$r_buff1_thd1~0_71) (= |v_P3Thread1of1ForFork2_~arg#1.base_55| |v_P3Thread1of1ForFork2_#in~arg#1.base_55|) (= v_~z~0_326 (ite .cse0 v_~z$mem_tmp~0_99 v_~__unbuffered_p3_EAX~0_184)) (= (ite (= (mod v_~z$w_buff0_used~0_411 256) 0) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57|) (= |v_P3Thread1of1ForFork2_~arg#1.offset_55| |v_P3Thread1of1ForFork2_#in~arg#1.offset_55|) (= (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1))) v_~z$r_buff0_thd4~0_235) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_62| v_~weak$$choice0~0_85) (= (ite .cse0 v_~z$w_buff0_used~0_411 (ite .cse2 v_~z$w_buff0_used~0_411 0)) v_~z$w_buff1_used~0_354) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_57|))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_411, ~z$w_buff0~0=v_~z$w_buff0~0_272, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_55|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_55|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_237, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_155, ~z~0=v_~z~0_327, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_62|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_181, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_55|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_236, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_57|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_187, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_184, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_235, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_99, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_409, ~z$w_buff0~0=v_~z$w_buff0~0_270, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_354, ~z$flush_delayed~0=v_~z$flush_delayed~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_85, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_71, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_55|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_155, ~z~0=v_~z~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_135, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_#t~nondet5#1, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:47:15,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] $Ultimate##0-->L790: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_8 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [384] L757-->L760: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 11:47:15,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:15,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2089 [2022-12-13 11:47:15,501 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 91 transitions, 598 flow [2022-12-13 11:47:15,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:15,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:15,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:15,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:47:15,502 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1990708944, now seen corresponding path program 1 times [2022-12-13 11:47:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:15,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210417801] [2022-12-13 11:47:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:15,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210417801] [2022-12-13 11:47:15,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210417801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:15,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:15,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014122419] [2022-12-13 11:47:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:15,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:47:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:47:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:47:15,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2022-12-13 11:47:15,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 91 transitions, 598 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:15,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:15,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2022-12-13 11:47:15,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:18,026 INFO L130 PetriNetUnfolder]: 18372/28502 cut-off events. [2022-12-13 11:47:18,026 INFO L131 PetriNetUnfolder]: For 43099/48888 co-relation queries the response was YES. [2022-12-13 11:47:18,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109360 conditions, 28502 events. 18372/28502 cut-off events. For 43099/48888 co-relation queries the response was YES. Maximal size of possible extension queue 1896. Compared 219659 event pairs, 233 based on Foata normal form. 3142/17385 useless extension candidates. Maximal degree in co-relation 109333. Up to 13987 conditions per place. [2022-12-13 11:47:18,134 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 41 selfloop transitions, 49 changer transitions 28/127 dead transitions. [2022-12-13 11:47:18,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 127 transitions, 1019 flow [2022-12-13 11:47:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-12-13 11:47:18,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-13 11:47:18,136 INFO L175 Difference]: Start difference. First operand has 77 places, 91 transitions, 598 flow. Second operand 6 states and 162 transitions. [2022-12-13 11:47:18,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 127 transitions, 1019 flow [2022-12-13 11:47:19,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 912 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-13 11:47:19,305 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 528 flow [2022-12-13 11:47:19,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2022-12-13 11:47:19,305 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2022-12-13 11:47:19,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:19,305 INFO L89 Accepts]: Start accepts. Operand has 75 places, 75 transitions, 528 flow [2022-12-13 11:47:19,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:19,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:19,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 528 flow [2022-12-13 11:47:19,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 75 transitions, 528 flow [2022-12-13 11:47:19,398 INFO L130 PetriNetUnfolder]: 959/1856 cut-off events. [2022-12-13 11:47:19,399 INFO L131 PetriNetUnfolder]: For 2681/4094 co-relation queries the response was YES. [2022-12-13 11:47:19,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 1856 events. 959/1856 cut-off events. For 2681/4094 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 12248 event pairs, 12 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 7157. Up to 1135 conditions per place. [2022-12-13 11:47:19,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 75 transitions, 528 flow [2022-12-13 11:47:19,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-13 11:47:21,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L847-->P3EXIT: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_469 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_210 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_284 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_470 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_401 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_470) v_~z$w_buff0_used~0_469) (= |v_P3Thread1of1ForFork2_#res#1.offset_53| 0) (= |v_P3Thread1of1ForFork2_#res#1.base_53| 0) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_401) v_~z$w_buff1_used~0_400) (= v_~z~0_382 (ite .cse0 v_~z$w_buff0~0_326 (ite .cse2 v_~z$w_buff1~0_278 v_~z~0_383))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_400 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_283 256) 0)))) 0 v_~z$r_buff1_thd4~0_210) v_~z$r_buff1_thd4~0_209) (= v_~__unbuffered_cnt~0_691 (+ v_~__unbuffered_cnt~0_692 1)) (= (ite .cse1 0 v_~z$r_buff0_thd4~0_284) v_~z$r_buff0_thd4~0_283)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_210, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_470, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_284, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_401, ~z$w_buff1~0=v_~z$w_buff1~0_278, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_692, ~z~0=v_~z~0_383} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_53|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_209, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_53|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_469, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_283, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_400, ~z$w_buff1~0=v_~z$w_buff1~0_278, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_691, ~z~0=v_~z~0_382} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0] and [601] L878-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_222 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_517 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_224 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_518 256) 0)))) (.cse0 (and .cse5 .cse2)) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_449 256) 0))))) (and (= v_~z$r_buff0_thd0~0_223 (ite .cse0 0 v_~z$r_buff0_thd0~0_224)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_139|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_139| 0) (= v_~z$w_buff0_used~0_517 (ite .cse1 0 v_~z$w_buff0_used~0_518)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_223 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_448 256) 0)))) 0 v_~z$r_buff1_thd0~0_222) v_~z$r_buff1_thd0~0_221) (= v_~main$tmp_guard1~0_172 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_201 0) (= v_~__unbuffered_p3_EAX~0_204 1) (= v_~__unbuffered_p0_EAX~0_191 0) (= v_~__unbuffered_p1_EBX~0_178 0) (= v_~__unbuffered_p3_EBX~0_171 0) (= v_~__unbuffered_p1_EAX~0_168 1))) 1 0) 0) 0 1)) (= v_~z~0_430 (ite .cse1 v_~z$w_buff0~0_350 (ite .cse4 v_~z$w_buff1~0_302 v_~z~0_431))) (= (mod v_~main$tmp_guard0~0_138 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_449) v_~z$w_buff1_used~0_448) (= (ite (= (ite (= v_~__unbuffered_cnt~0_739 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_138) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143| (mod v_~main$tmp_guard1~0_172 256))))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_178, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_518, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_449, ~z$w_buff1~0=v_~z$w_buff1~0_302, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_171, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_224, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_739, ~z~0=v_~z~0_431} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_139|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_121|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_178, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_448, ~z$w_buff1~0=v_~z$w_buff1~0_302, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_172, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_138, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_137|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_223, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_739, ~z~0=v_~z~0_430, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre13#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:21,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] L847-->P3FINAL: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_473 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_214 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_288 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_474 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_405 256) 0)) .cse1)) (.cse3 (and .cse5 .cse0))) (and (= |v_P3Thread1of1ForFork2_#res#1.offset_55| 0) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_287 256) 0)) .cse0) (and (not (= (mod v_~z$w_buff1_used~0_404 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_214) v_~z$r_buff1_thd4~0_213) (= v_~z$w_buff1_used~0_404 (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_405)) (= v_~__unbuffered_cnt~0_695 (+ v_~__unbuffered_cnt~0_696 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_55| 0) (= v_~z$w_buff0_used~0_473 (ite .cse4 0 v_~z$w_buff0_used~0_474)) (= (ite .cse4 v_~z$w_buff0~0_328 (ite .cse2 v_~z$w_buff1~0_280 v_~z~0_387)) v_~z~0_386) (= v_~z$r_buff0_thd4~0_287 (ite .cse3 0 v_~z$r_buff0_thd4~0_288))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_214, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_474, ~z$w_buff0~0=v_~z$w_buff0~0_328, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_288, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ~z$w_buff1~0=v_~z$w_buff1~0_280, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_696, ~z~0=v_~z~0_387} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_55|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_213, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_55|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_473, ~z$w_buff0~0=v_~z$w_buff0~0_328, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_287, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_404, ~z$w_buff1~0=v_~z$w_buff1~0_280, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_695, ~z~0=v_~z~0_386} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0] and [601] L878-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_222 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_517 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_224 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_518 256) 0)))) (.cse0 (and .cse5 .cse2)) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_449 256) 0))))) (and (= v_~z$r_buff0_thd0~0_223 (ite .cse0 0 v_~z$r_buff0_thd0~0_224)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_139|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_139| 0) (= v_~z$w_buff0_used~0_517 (ite .cse1 0 v_~z$w_buff0_used~0_518)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_223 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_448 256) 0)))) 0 v_~z$r_buff1_thd0~0_222) v_~z$r_buff1_thd0~0_221) (= v_~main$tmp_guard1~0_172 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_201 0) (= v_~__unbuffered_p3_EAX~0_204 1) (= v_~__unbuffered_p0_EAX~0_191 0) (= v_~__unbuffered_p1_EBX~0_178 0) (= v_~__unbuffered_p3_EBX~0_171 0) (= v_~__unbuffered_p1_EAX~0_168 1))) 1 0) 0) 0 1)) (= v_~z~0_430 (ite .cse1 v_~z$w_buff0~0_350 (ite .cse4 v_~z$w_buff1~0_302 v_~z~0_431))) (= (mod v_~main$tmp_guard0~0_138 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_449) v_~z$w_buff1_used~0_448) (= (ite (= (ite (= v_~__unbuffered_cnt~0_739 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_138) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143| (mod v_~main$tmp_guard1~0_172 256))))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_178, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_518, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_449, ~z$w_buff1~0=v_~z$w_buff1~0_302, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_171, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_224, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_739, ~z~0=v_~z~0_431} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_139|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_121|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_178, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_448, ~z$w_buff1~0=v_~z$w_buff1~0_302, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_172, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_138, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_137|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_223, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_739, ~z~0=v_~z~0_430, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre13#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:22,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] L847-->L857: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_254 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_513 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_328 256))))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_445 256) 0)))) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_514 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~z$r_buff0_thd4~0_328) v_~z$r_buff0_thd4~0_327) (= v_~z~0_426 (ite .cse1 v_~z$w_buff0~0_348 (ite .cse2 v_~z$w_buff1~0_300 v_~z~0_427))) (= v_~z$w_buff1_used~0_444 (ite (or .cse0 .cse2) 0 v_~z$w_buff1_used~0_445)) (= v_~__unbuffered_cnt~0_735 (+ v_~__unbuffered_cnt~0_736 1)) (= v_~z$w_buff0_used~0_513 (ite .cse1 0 v_~z$w_buff0_used~0_514)) (= (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_444 256)))) (and (not (= (mod v_~z$r_buff0_thd4~0_327 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_254) v_~z$r_buff1_thd4~0_253)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_254, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_348, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_328, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_445, ~z$w_buff1~0=v_~z$w_buff1~0_300, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_736, ~z~0=v_~z~0_427} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_253, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_513, ~z$w_buff0~0=v_~z$w_buff0~0_348, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_327, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_444, ~z$w_buff1~0=v_~z$w_buff1~0_300, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_735, ~z~0=v_~z~0_426} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0] and [601] L878-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_222 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_517 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_224 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_518 256) 0)))) (.cse0 (and .cse5 .cse2)) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_449 256) 0))))) (and (= v_~z$r_buff0_thd0~0_223 (ite .cse0 0 v_~z$r_buff0_thd0~0_224)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_139|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_139| 0) (= v_~z$w_buff0_used~0_517 (ite .cse1 0 v_~z$w_buff0_used~0_518)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_223 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_448 256) 0)))) 0 v_~z$r_buff1_thd0~0_222) v_~z$r_buff1_thd0~0_221) (= v_~main$tmp_guard1~0_172 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_201 0) (= v_~__unbuffered_p3_EAX~0_204 1) (= v_~__unbuffered_p0_EAX~0_191 0) (= v_~__unbuffered_p1_EBX~0_178 0) (= v_~__unbuffered_p3_EBX~0_171 0) (= v_~__unbuffered_p1_EAX~0_168 1))) 1 0) 0) 0 1)) (= v_~z~0_430 (ite .cse1 v_~z$w_buff0~0_350 (ite .cse4 v_~z$w_buff1~0_302 v_~z~0_431))) (= (mod v_~main$tmp_guard0~0_138 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_449) v_~z$w_buff1_used~0_448) (= (ite (= (ite (= v_~__unbuffered_cnt~0_739 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_138) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143| (mod v_~main$tmp_guard1~0_172 256))))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_178, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_518, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_449, ~z$w_buff1~0=v_~z$w_buff1~0_302, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_171, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_224, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_739, ~z~0=v_~z~0_431} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_139|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_121|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_178, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_448, ~z$w_buff1~0=v_~z$w_buff1~0_302, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_172, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_138, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_137|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_223, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_143|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_739, ~z~0=v_~z~0_430, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre13#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:22,630 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:47:22,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3325 [2022-12-13 11:47:22,631 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 603 flow [2022-12-13 11:47:22,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:22,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:22,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:22,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:47:22,631 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:22,631 INFO L85 PathProgramCache]: Analyzing trace with hash 603607280, now seen corresponding path program 1 times [2022-12-13 11:47:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:22,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951435770] [2022-12-13 11:47:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:22,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951435770] [2022-12-13 11:47:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951435770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:22,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:22,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:47:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538392626] [2022-12-13 11:47:22,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:22,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:22,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2022-12-13 11:47:22,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:22,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:22,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2022-12-13 11:47:22,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:23,445 INFO L130 PetriNetUnfolder]: 3237/5691 cut-off events. [2022-12-13 11:47:23,445 INFO L131 PetriNetUnfolder]: For 14228/14539 co-relation queries the response was YES. [2022-12-13 11:47:23,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28536 conditions, 5691 events. 3237/5691 cut-off events. For 14228/14539 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 42366 event pairs, 355 based on Foata normal form. 177/3850 useless extension candidates. Maximal degree in co-relation 28512. Up to 3071 conditions per place. [2022-12-13 11:47:23,463 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 1 changer transitions 82/142 dead transitions. [2022-12-13 11:47:23,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1419 flow [2022-12-13 11:47:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:47:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:47:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-12-13 11:47:23,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6611111111111111 [2022-12-13 11:47:23,464 INFO L175 Difference]: Start difference. First operand has 66 places, 73 transitions, 603 flow. Second operand 4 states and 119 transitions. [2022-12-13 11:47:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1419 flow [2022-12-13 11:47:23,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 142 transitions, 1089 flow, removed 82 selfloop flow, removed 6 redundant places. [2022-12-13 11:47:23,655 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 348 flow [2022-12-13 11:47:23,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2022-12-13 11:47:23,656 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2022-12-13 11:47:23,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:23,656 INFO L89 Accepts]: Start accepts. Operand has 65 places, 60 transitions, 348 flow [2022-12-13 11:47:23,657 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:23,657 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:23,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 60 transitions, 348 flow [2022-12-13 11:47:23,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 348 flow [2022-12-13 11:47:23,757 INFO L130 PetriNetUnfolder]: 440/972 cut-off events. [2022-12-13 11:47:23,758 INFO L131 PetriNetUnfolder]: For 1883/1884 co-relation queries the response was YES. [2022-12-13 11:47:23,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 972 events. 440/972 cut-off events. For 1883/1884 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 6789 event pairs, 8 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 3402. Up to 406 conditions per place. [2022-12-13 11:47:23,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 60 transitions, 348 flow [2022-12-13 11:47:23,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-13 11:47:24,299 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:47:24,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-13 11:47:24,300 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 371 flow [2022-12-13 11:47:24,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:24,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:24,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:24,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:47:24,301 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1213358290, now seen corresponding path program 1 times [2022-12-13 11:47:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:24,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412046021] [2022-12-13 11:47:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:47:24,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:47:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:47:24,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:47:24,398 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:47:24,399 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:47:24,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:47:24,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:47:24,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:47:24,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:47:24,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:47:24,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:47:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:47:24,402 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:24,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:47:24,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:47:24,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:47:24 BasicIcfg [2022-12-13 11:47:24,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:47:24,463 INFO L158 Benchmark]: Toolchain (without parser) took 60608.55ms. Allocated memory was 188.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 162.8MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 11:47:24,464 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:47:24,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.09ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 133.8MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 11:47:24,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.52ms. Allocated memory is still 188.7MB. Free memory was 133.8MB in the beginning and 131.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:47:24,464 INFO L158 Benchmark]: Boogie Preprocessor took 55.68ms. Allocated memory is still 188.7MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:47:24,464 INFO L158 Benchmark]: RCFGBuilder took 766.43ms. Allocated memory is still 188.7MB. Free memory was 129.0MB in the beginning and 90.8MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 11:47:24,465 INFO L158 Benchmark]: TraceAbstraction took 59181.93ms. Allocated memory was 188.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 89.2MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 11:47:24,466 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.14ms. Allocated memory is still 188.7MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 518.09ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 133.8MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.52ms. Allocated memory is still 188.7MB. Free memory was 133.8MB in the beginning and 131.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.68ms. Allocated memory is still 188.7MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 766.43ms. Allocated memory is still 188.7MB. Free memory was 129.0MB in the beginning and 90.8MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 59181.93ms. Allocated memory was 188.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 89.2MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 138 PlacesBefore, 78 PlacesAfterwards, 127 TransitionsBefore, 65 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4555, independent: 4340, independent conditional: 4340, independent unconditional: 0, dependent: 215, dependent conditional: 215, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4555, independent: 4340, independent conditional: 0, independent unconditional: 4340, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4555, independent: 4340, independent conditional: 0, independent unconditional: 4340, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4555, independent: 4340, independent conditional: 0, independent unconditional: 4340, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2546, independent: 2474, independent conditional: 0, independent unconditional: 2474, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2546, independent: 2456, independent conditional: 0, independent unconditional: 2456, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4555, independent: 1866, independent conditional: 0, independent unconditional: 1866, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 2546, unknown conditional: 0, unknown unconditional: 2546] , Statistics on independence cache: Total cache size (in pairs): 4417, Positive cache size: 4345, Positive conditional cache size: 0, Positive unconditional cache size: 4345, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 513, independent: 469, independent conditional: 469, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 513, independent: 469, independent conditional: 12, independent unconditional: 457, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 513, independent: 469, independent conditional: 12, independent unconditional: 457, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 513, independent: 469, independent conditional: 12, independent unconditional: 457, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, independent: 364, independent conditional: 12, independent unconditional: 352, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, independent: 310, independent conditional: 0, independent unconditional: 310, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 118, dependent conditional: 21, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 513, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 396, unknown conditional: 15, unknown unconditional: 381] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 364, Positive conditional cache size: 12, Positive unconditional cache size: 352, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 296, independent conditional: 296, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 296, independent conditional: 19, independent unconditional: 277, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 390, Positive conditional cache size: 12, Positive unconditional cache size: 378, Negative cache size: 34, Negative conditional cache size: 3, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 980 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 19, independent unconditional: 264, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 309, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 309, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 433, Positive cache size: 397, Positive conditional cache size: 12, Positive unconditional cache size: 385, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 976 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 28, independent unconditional: 255, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 309, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 309, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 398, Positive conditional cache size: 12, Positive unconditional cache size: 386, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 390, independent: 366, independent conditional: 366, 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: 390, independent: 366, independent conditional: 98, independent unconditional: 268, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 390, independent: 366, independent conditional: 84, independent unconditional: 282, 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: 390, independent: 366, independent conditional: 84, independent unconditional: 282, 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: 45, independent: 45, independent conditional: 12, independent unconditional: 33, 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: 45, independent: 45, independent conditional: 0, independent unconditional: 45, 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: 390, independent: 321, independent conditional: 72, independent unconditional: 249, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 45, unknown conditional: 12, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 443, Positive conditional cache size: 24, Positive unconditional cache size: 419, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 346, independent: 316, independent conditional: 316, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 346, independent: 316, independent conditional: 117, independent unconditional: 199, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 346, independent: 316, independent conditional: 103, independent unconditional: 213, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 346, independent: 316, independent conditional: 103, independent unconditional: 213, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 346, independent: 313, independent conditional: 103, independent unconditional: 210, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 446, Positive conditional cache size: 24, Positive unconditional cache size: 422, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 568, independent: 506, independent conditional: 506, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 568, independent: 506, independent conditional: 164, independent unconditional: 342, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 568, independent: 506, independent conditional: 130, independent unconditional: 376, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 568, independent: 506, independent conditional: 130, independent unconditional: 376, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 568, independent: 489, independent conditional: 130, independent unconditional: 359, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 479, Positive conditional cache size: 24, Positive unconditional cache size: 455, Negative cache size: 41, Negative conditional cache size: 3, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 65 PlacesBefore, 65 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1145, independent: 1071, independent conditional: 1071, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1145, independent: 1071, independent conditional: 566, independent unconditional: 505, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1145, independent: 1071, independent conditional: 541, independent unconditional: 530, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1145, independent: 1071, independent conditional: 541, independent unconditional: 530, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1145, independent: 1056, independent conditional: 531, independent unconditional: 525, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 16, unknown conditional: 10, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 526, Positive conditional cache size: 34, Positive unconditional cache size: 492, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 68 PlacesBefore, 68 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 878, independent: 832, independent conditional: 832, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 878, independent: 832, independent conditional: 456, independent unconditional: 376, dependent: 46, dependent conditional: 20, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 886, independent: 832, independent conditional: 349, independent unconditional: 483, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 886, independent: 832, independent conditional: 349, independent unconditional: 483, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 886, independent: 820, independent conditional: 340, independent unconditional: 480, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 563, Positive conditional cache size: 43, Positive unconditional cache size: 520, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 135, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 80 PlacesBefore, 77 PlacesAfterwards, 101 TransitionsBefore, 98 TransitionsAfterwards, 2012 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1009, independent: 994, independent conditional: 994, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1009, independent: 994, independent conditional: 690, independent unconditional: 304, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1009, independent: 994, independent conditional: 590, independent unconditional: 404, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1009, independent: 994, independent conditional: 590, independent unconditional: 404, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 8, independent unconditional: 18, 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: 26, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1009, independent: 968, independent conditional: 582, independent unconditional: 386, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 26, unknown conditional: 8, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 680, Positive conditional cache size: 51, Positive unconditional cache size: 629, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 78 PlacesBefore, 77 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 1792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 300, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 300, independent: 292, independent conditional: 164, independent unconditional: 128, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 300, independent: 292, independent conditional: 104, independent unconditional: 188, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 300, independent: 292, independent conditional: 104, independent unconditional: 188, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 300, independent: 289, independent conditional: 104, independent unconditional: 185, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 729, Positive conditional cache size: 51, Positive unconditional cache size: 678, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 70 PlacesBefore, 66 PlacesAfterwards, 75 TransitionsBefore, 73 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 694, independent: 688, independent conditional: 688, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 694, independent: 688, independent conditional: 484, independent unconditional: 204, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 694, independent: 688, independent conditional: 477, independent unconditional: 211, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 694, independent: 688, independent conditional: 477, independent unconditional: 211, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 48, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, 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: 694, independent: 637, independent conditional: 429, independent unconditional: 208, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 51, unknown conditional: 48, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1151, Positive conditional cache size: 99, Positive unconditional cache size: 1052, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, 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.5s, 61 PlacesBefore, 59 PlacesAfterwards, 60 TransitionsBefore, 58 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, 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: 84, independent: 84, independent conditional: 67, independent unconditional: 17, 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: 84, independent: 84, independent conditional: 66, independent unconditional: 18, 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: 84, independent: 84, independent conditional: 66, independent unconditional: 18, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 83, independent conditional: 66, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1274, Positive conditional cache size: 111, Positive unconditional cache size: 1163, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=14, t325={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=15, t325={7:0}, t326={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=16, t325={7:0}, t326={8:0}, t327={9:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=17, t325={7:0}, t326={8:0}, t327={9:0}, t328={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 [L774] 2 __unbuffered_p1_EAX = x [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 4 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 4 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 4 !(!cond) [L882] RET 4 assume_abort_if_not(main$tmp_guard0) [L884] 4 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 4 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 4 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L891] 4 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 4 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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: 874]: 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: 876]: 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: 872]: 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: 878]: 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 9 procedures, 166 locations, 7 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: 59.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1378 IncrementalHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 31 mSDtfsCounter, 1378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:47:24,494 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...