/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/safe001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:58:32,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:58:32,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:58:33,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:58:33,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:58:33,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:58:33,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:58:33,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:58:33,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:58:33,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:58:33,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:58:33,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:58:33,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:58:33,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:58:33,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:58:33,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:58:33,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:58:33,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:58:33,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:58:33,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:58:33,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:58:33,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:58:33,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:58:33,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:58:33,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:58:33,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:58:33,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:58:33,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:58:33,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:58:33,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:58:33,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:58:33,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:58:33,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:58:33,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:58:33,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:58:33,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:58:33,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:58:33,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:58:33,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:58:33,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:58:33,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:58:33,089 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:58:33,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:58:33,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:58:33,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:58:33,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:58:33,114 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:58:33,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:58:33,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:58:33,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:58:33,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:58:33,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:58:33,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:58:33,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:58:33,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:58:33,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:33,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:58:33,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:58:33,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:58:33,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:58:33,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:58:33,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:58:33,117 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:58:33,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:58:33,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:58:33,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:58:33,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:58:33,406 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:58:33,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2022-12-13 11:58:34,435 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:58:34,735 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:58:34,737 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2022-12-13 11:58:34,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c016514b/af3f94d79af842198e36046281ec6a9f/FLAG90ab8992c [2022-12-13 11:58:34,756 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c016514b/af3f94d79af842198e36046281ec6a9f [2022-12-13 11:58:34,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:58:34,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:58:34,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:34,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:58:34,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:58:34,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:34" (1/1) ... [2022-12-13 11:58:34,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf5e2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:34, skipping insertion in model container [2022-12-13 11:58:34,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:34" (1/1) ... [2022-12-13 11:58:34,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:58:34,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:58:34,897 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/safe001_power.oepc.i[995,1008] [2022-12-13 11:58:35,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:35,113 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:58:35,122 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/safe001_power.oepc.i[995,1008] [2022-12-13 11:58:35,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:35,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:35,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:35,215 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:58:35,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35 WrapperNode [2022-12-13 11:58:35,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:35,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:35,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:58:35,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:58:35,221 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:58:35" (1/1) ... [2022-12-13 11:58:35,247 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:58:35" (1/1) ... [2022-12-13 11:58:35,264 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2022-12-13 11:58:35,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:35,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:58:35,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:58:35,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:58:35,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,294 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:58:35,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:58:35,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:58:35,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:58:35,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (1/1) ... [2022-12-13 11:58:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:58:35,322 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:58:35,325 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:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:58:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:58:35,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:58:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:58:35,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:58:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:58:35,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:58:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:58:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:58:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:58:35,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:58:35,352 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:58:35,524 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:58:35,526 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:58:35,904 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:58:36,288 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:58:36,288 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:58:36,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:36 BoogieIcfgContainer [2022-12-13 11:58:36,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:58:36,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:58:36,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:58:36,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:58:36,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:58:34" (1/3) ... [2022-12-13 11:58:36,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1cbbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:36, skipping insertion in model container [2022-12-13 11:58:36,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:35" (2/3) ... [2022-12-13 11:58:36,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1cbbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:36, skipping insertion in model container [2022-12-13 11:58:36,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:36" (3/3) ... [2022-12-13 11:58:36,300 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2022-12-13 11:58:36,313 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:58:36,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:58:36,314 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:58:36,376 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:58:36,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 11:58:36,476 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 11:58:36,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:36,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 11:58:36,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 11:58:36,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-13 11:58:36,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:36,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 11:58:36,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-13 11:58:36,529 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-13 11:58:36,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:36,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 11:58:36,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 11:58:36,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-13 11:58:45,008 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-13 11:58:45,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:58:45,036 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;@923f165, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:58:45,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 11:58:45,040 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 11:58:45,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:45,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:45,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:45,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1203329307, now seen corresponding path program 1 times [2022-12-13 11:58:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888785594] [2022-12-13 11:58:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:45,187 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:58:45,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:45,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888785594] [2022-12-13 11:58:45,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888785594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:45,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:45,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372366603] [2022-12-13 11:58:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:45,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:58:45,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:58:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:58:45,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 11:58:45,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:45,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:45,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 11:58:45,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:45,508 INFO L130 PetriNetUnfolder]: 909/1441 cut-off events. [2022-12-13 11:58:45,508 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 11:58:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1441 events. 909/1441 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7261 event pairs, 909 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2843. Up to 1359 conditions per place. [2022-12-13 11:58:45,519 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 20 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 11:58:45,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 107 flow [2022-12-13 11:58:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:58:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:58:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-13 11:58:45,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 11:58:45,528 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 39 transitions. [2022-12-13 11:58:45,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 107 flow [2022-12-13 11:58:45,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:58:45,531 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 11:58:45,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 11:58:45,534 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 11:58:45,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:45,535 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 11:58:45,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:45,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:45,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 11:58:45,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 11:58:45,558 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 11:58:45,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:45,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 11:58:45,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 11:58:45,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 11:58:45,872 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:45,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-13 11:58:45,873 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 11:58:45,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:45,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:45,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:45,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:58:45,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:45,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1053261914, now seen corresponding path program 1 times [2022-12-13 11:58:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:45,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037406997] [2022-12-13 11:58:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:46,075 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:58:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037406997] [2022-12-13 11:58:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037406997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:46,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090358457] [2022-12-13 11:58:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:46,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:46,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:46,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 11:58:46,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:58:46,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:46,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 11:58:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:46,385 INFO L130 PetriNetUnfolder]: 1136/1859 cut-off events. [2022-12-13 11:58:46,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:46,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1859 events. 1136/1859 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9490 event pairs, 559 based on Foata normal form. 10/1545 useless extension candidates. Maximal degree in co-relation 3602. Up to 1615 conditions per place. [2022-12-13 11:58:46,396 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 31 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-13 11:58:46,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 162 flow [2022-12-13 11:58:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 11:58:46,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-13 11:58:46,398 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 59 transitions. [2022-12-13 11:58:46,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 162 flow [2022-12-13 11:58:46,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:58:46,399 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 83 flow [2022-12-13 11:58:46,399 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 11:58:46,400 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 11:58:46,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:46,400 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 83 flow [2022-12-13 11:58:46,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:46,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:46,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 83 flow [2022-12-13 11:58:46,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 83 flow [2022-12-13 11:58:46,409 INFO L130 PetriNetUnfolder]: 3/45 cut-off events. [2022-12-13 11:58:46,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:46,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 45 events. 3/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2022-12-13 11:58:46,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 83 flow [2022-12-13 11:58:46,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 11:58:46,414 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:46,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 11:58:46,415 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 83 flow [2022-12-13 11:58:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:58:46,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:46,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:58:46,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1708619980, now seen corresponding path program 1 times [2022-12-13 11:58:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:46,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790453871] [2022-12-13 11:58:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:46,590 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:58:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:46,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790453871] [2022-12-13 11:58:46,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790453871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:46,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:46,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940524003] [2022-12-13 11:58:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:46,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:46,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 11:58:46,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:46,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:46,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 11:58:46,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:46,851 INFO L130 PetriNetUnfolder]: 984/1674 cut-off events. [2022-12-13 11:58:46,851 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2022-12-13 11:58:46,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 1674 events. 984/1674 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9068 event pairs, 227 based on Foata normal form. 23/1387 useless extension candidates. Maximal degree in co-relation 3444. Up to 1190 conditions per place. [2022-12-13 11:58:46,857 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 11:58:46,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 170 flow [2022-12-13 11:58:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 11:58:46,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 11:58:46,860 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 83 flow. Second operand 3 states and 57 transitions. [2022-12-13 11:58:46,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 170 flow [2022-12-13 11:58:46,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:58:46,861 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 88 flow [2022-12-13 11:58:46,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 11:58:46,862 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-13 11:58:46,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:46,862 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 88 flow [2022-12-13 11:58:46,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:46,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:46,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 88 flow [2022-12-13 11:58:46,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 88 flow [2022-12-13 11:58:46,869 INFO L130 PetriNetUnfolder]: 3/45 cut-off events. [2022-12-13 11:58:46,869 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:58:46,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 45 events. 3/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 61. Up to 10 conditions per place. [2022-12-13 11:58:46,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 88 flow [2022-12-13 11:58:46,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 11:58:46,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:46,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 11:58:46,872 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 88 flow [2022-12-13 11:58:46,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:46,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:46,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:46,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:58:46,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 487312229, now seen corresponding path program 1 times [2022-12-13 11:58:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:46,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726284237] [2022-12-13 11:58:46,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:47,218 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:58:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:47,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726284237] [2022-12-13 11:58:47,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726284237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:47,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:47,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977849175] [2022-12-13 11:58:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:47,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:47,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 11:58:47,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:58:47,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:47,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 11:58:47,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:47,466 INFO L130 PetriNetUnfolder]: 951/1591 cut-off events. [2022-12-13 11:58:47,466 INFO L131 PetriNetUnfolder]: For 410/410 co-relation queries the response was YES. [2022-12-13 11:58:47,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 1591 events. 951/1591 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8288 event pairs, 550 based on Foata normal form. 16/1302 useless extension candidates. Maximal degree in co-relation 3490. Up to 1229 conditions per place. [2022-12-13 11:58:47,474 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 11:58:47,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 195 flow [2022-12-13 11:58:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 11:58:47,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2022-12-13 11:58:47,475 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 88 flow. Second operand 3 states and 62 transitions. [2022-12-13 11:58:47,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 195 flow [2022-12-13 11:58:47,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:47,477 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 92 flow [2022-12-13 11:58:47,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-13 11:58:47,477 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-13 11:58:47,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:47,477 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 92 flow [2022-12-13 11:58:47,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:47,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:47,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 92 flow [2022-12-13 11:58:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 92 flow [2022-12-13 11:58:47,484 INFO L130 PetriNetUnfolder]: 3/45 cut-off events. [2022-12-13 11:58:47,484 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:58:47,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 45 events. 3/45 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2022-12-13 11:58:47,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 92 flow [2022-12-13 11:58:47,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 11:58:47,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:47,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-13 11:58:47,717 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 92 flow [2022-12-13 11:58:47,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:58:47,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:47,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:47,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:58:47,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2131649587, now seen corresponding path program 1 times [2022-12-13 11:58:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:47,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828736656] [2022-12-13 11:58:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:47,825 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:58:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:47,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828736656] [2022-12-13 11:58:47,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828736656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:47,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:47,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811493810] [2022-12-13 11:58:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:47,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:47,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 11:58:47,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:58:47,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:47,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 11:58:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:48,140 INFO L130 PetriNetUnfolder]: 1437/2365 cut-off events. [2022-12-13 11:58:48,141 INFO L131 PetriNetUnfolder]: For 824/824 co-relation queries the response was YES. [2022-12-13 11:58:48,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2365 events. 1437/2365 cut-off events. For 824/824 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13702 event pairs, 678 based on Foata normal form. 60/1898 useless extension candidates. Maximal degree in co-relation 5299. Up to 1290 conditions per place. [2022-12-13 11:58:48,148 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 35 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 11:58:48,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 203 flow [2022-12-13 11:58:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 11:58:48,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2022-12-13 11:58:48,150 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 92 flow. Second operand 3 states and 62 transitions. [2022-12-13 11:58:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 203 flow [2022-12-13 11:58:48,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:48,152 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 99 flow [2022-12-13 11:58:48,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-13 11:58:48,152 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2022-12-13 11:58:48,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:48,152 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 99 flow [2022-12-13 11:58:48,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:48,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:48,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 99 flow [2022-12-13 11:58:48,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 99 flow [2022-12-13 11:58:48,159 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 11:58:48,159 INFO L131 PetriNetUnfolder]: For 34/40 co-relation queries the response was YES. [2022-12-13 11:58:48,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 44 events. 0/44 cut-off events. For 34/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 143 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 11:58:48,160 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 99 flow [2022-12-13 11:58:48,160 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 11:58:48,161 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:48,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 11:58:48,162 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 99 flow [2022-12-13 11:58:48,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:58:48,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:48,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:48,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:58:48,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2118131433, now seen corresponding path program 1 times [2022-12-13 11:58:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:48,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320056763] [2022-12-13 11:58:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:49,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:58:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320056763] [2022-12-13 11:58:49,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320056763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:49,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:49,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:58:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985374295] [2022-12-13 11:58:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:58:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:58:49,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:58:49,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 11:58:49,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 99 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:58:49,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:49,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 11:58:49,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:49,918 INFO L130 PetriNetUnfolder]: 2324/3755 cut-off events. [2022-12-13 11:58:49,918 INFO L131 PetriNetUnfolder]: For 1720/1760 co-relation queries the response was YES. [2022-12-13 11:58:49,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8474 conditions, 3755 events. 2324/3755 cut-off events. For 1720/1760 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22285 event pairs, 514 based on Foata normal form. 29/3094 useless extension candidates. Maximal degree in co-relation 8460. Up to 2712 conditions per place. [2022-12-13 11:58:49,932 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 53 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2022-12-13 11:58:49,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 375 flow [2022-12-13 11:58:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:58:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:58:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-13 11:58:49,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2022-12-13 11:58:49,934 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 99 flow. Second operand 6 states and 109 transitions. [2022-12-13 11:58:49,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 375 flow [2022-12-13 11:58:49,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 358 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 11:58:49,938 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 214 flow [2022-12-13 11:58:49,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-13 11:58:49,938 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2022-12-13 11:58:49,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:49,938 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 214 flow [2022-12-13 11:58:49,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:49,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:49,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 214 flow [2022-12-13 11:58:49,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 214 flow [2022-12-13 11:58:49,977 INFO L130 PetriNetUnfolder]: 73/331 cut-off events. [2022-12-13 11:58:49,977 INFO L131 PetriNetUnfolder]: For 252/265 co-relation queries the response was YES. [2022-12-13 11:58:49,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 331 events. 73/331 cut-off events. For 252/265 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2335 event pairs, 14 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 712. Up to 82 conditions per place. [2022-12-13 11:58:49,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 214 flow [2022-12-13 11:58:49,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 11:58:50,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L824-->L826: Formula: (= (store |v_#memory_int_25| |v_~#y~0.base_19| (store (select |v_#memory_int_25| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2)) |v_#memory_int_24|) InVars {#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_24|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [640] L861-->L867: Formula: (let ((.cse8 (= (mod v_~y$r_buff0_thd0~0_68 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff0_used~0_269 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_63 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_251 256) 0)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_268 256) 0))) (.cse5 (not .cse8))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (not .cse11)) (.cse1 (not .cse10)) (.cse3 (select |v_#memory_int_283| |v_~#y~0.base_210|)) (.cse6 (not .cse7))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~y$w_buff1_used~0_251) v_~y$w_buff1_used~0_250) (= (store |v_#memory_int_283| |v_~#y~0.base_210| (store .cse3 |v_~#y~0.offset_210| |v_ULTIMATE.start_main_#t~ite41#1_26|)) |v_#memory_int_282|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_250 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_67 256) 0)))) 0 v_~y$r_buff1_thd0~0_63) v_~y$r_buff1_thd0~0_62) (= v_~y$r_buff0_thd0~0_67 (ite .cse2 0 v_~y$r_buff0_thd0~0_68)) (= (ite (and .cse5 .cse6) 0 v_~y$w_buff0_used~0_269) v_~y$w_buff0_used~0_268) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem39#1_33| |v_ULTIMATE.start_main_#t~mem39#1_29|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_30| |v_ULTIMATE.start_main_#t~ite41#1_26|) (or .cse7 .cse8) (or (and .cse9 .cse0 (= v_~y$w_buff1~0_121 |v_ULTIMATE.start_main_#t~ite40#1_30|) .cse1) (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite40#1_30| |v_ULTIMATE.start_main_#t~mem39#1_33|) (= |v_ULTIMATE.start_main_#t~mem39#1_33| (select .cse3 |v_~#y~0.offset_210|))))) (and .cse5 .cse9 .cse6 (= |v_ULTIMATE.start_main_#t~ite41#1_26| v_~y$w_buff0~0_123) (= |v_ULTIMATE.start_main_#t~ite40#1_30| |v_ULTIMATE.start_main_#t~ite40#1_26|)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_210|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_269, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~y$w_buff0~0=v_~y$w_buff0~0_123, #memory_int=|v_#memory_int_283|, ~#y~0.base=|v_~#y~0.base_210|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_63, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_251} OutVars{ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_22|, ~#y~0.offset=|v_~#y~0.offset_210|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_268, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_123, #memory_int=|v_#memory_int_282|, ~#y~0.base=|v_~#y~0.base_210|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_250} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_26|, |v_ULTIMATE.start_main_#t~mem39#1_33|, |v_ULTIMATE.start_main_#t~ite40#1_30|] AssignedVars[ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~mem39#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite40#1, ~y$w_buff1_used~0] [2022-12-13 11:58:50,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L824-->L826: Formula: (= (store |v_#memory_int_25| |v_~#y~0.base_19| (store (select |v_#memory_int_25| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2)) |v_#memory_int_24|) InVars {#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_24|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [800] $Ultimate##0-->L776: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd1~0_84 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_342 256) 0)) (.cse25 (mod v_~y$w_buff0_used~0_343 256)) (.cse26 (mod v_~weak$$choice0~0_111 256))) (let ((.cse17 (= .cse26 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_321 256) 0)) (.cse24 (= .cse25 0)) (.cse8 (= (mod v_~weak$$choice2~0_136 256) 0)) (.cse7 (select |v_#memory_int_399| |v_~#y~0.base_254|)) (.cse4 (not .cse1)) (.cse22 (not .cse6))) (let ((.cse2 (and .cse4 .cse22)) (.cse10 (not (= (mod v_~y$w_buff1_used~0_320 256) 0))) (.cse12 (select .cse7 |v_~#y~0.offset_254|)) (.cse0 (not .cse8)) (.cse3 (= (mod v_~y$r_buff1_thd1~0_80 256) 0)) (.cse23 (not .cse24)) (.cse5 (not .cse19)) (.cse11 (not .cse17)) (.cse16 (= (mod v_~weak$$choice1~0_84 256) 0))) (and (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_44 |v_~#y~0.offset_254|) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= (ite .cse0 v_~y$w_buff1_used~0_321 (ite .cse1 v_~y$w_buff1_used~0_321 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~weak$$choice0~0_111 0)))) v_~y$w_buff1_used~0_320) (= (store |v_#memory_int_399| |v_~#y~0.base_254| (store .cse7 |v_~#y~0.offset_254| |v_P0_#t~ite18_33|)) |v_#memory_int_398|) (= v_~y$flush_delayed~0_116 0) (= v_~__unbuffered_p0_EAX$read_delayed~0_43 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork1_#t~nondet6_10| v_~weak$$choice1~0_84) (or (and (= |v_P0Thread1of1ForFork1_#t~mem17_10| |v_P0_#t~mem17_30|) (= |v_P0_#t~ite18_33| v_~y$mem_tmp~0_88) .cse0) (and (= |v_P0_#t~mem17_30| v_~__unbuffered_p0_EAX~0_67) .cse8 (= |v_P0_#t~ite18_33| |v_P0_#t~mem17_30|))) (= v_~y$w_buff1~0_184 v_~y$w_buff1~0_183) (= (ite .cse0 v_~y$r_buff1_thd1~0_80 (ite .cse1 v_~y$r_buff1_thd1~0_80 (let ((.cse9 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (ite (and (not .cse9) .cse4) 0 (ite (and .cse3 .cse4 .cse9 .cse10) (ite .cse11 v_~y$r_buff1_thd1~0_80 0) 0))))) v_~y$r_buff1_thd1~0_79) (= v_~weak$$choice2~0_136 |v_P0Thread1of1ForFork1_#t~nondet4_10|) (= v_~y$mem_tmp~0_88 .cse12) (= |v_~#y~0.base_254| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_44) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_111) (= (ite .cse0 v_~y$r_buff0_thd1~0_84 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite .cse2 0 (ite (and .cse3 .cse4 .cse10 .cse6) v_~y$r_buff0_thd1~0_84 0)))) v_~y$r_buff0_thd1~0_83) (= v_~y$w_buff0~0_189 v_~y$w_buff0~0_190) (let ((.cse13 (= |v_P0_#t~ite12_67| |v_P0Thread1of1ForFork1_#t~ite12_10|)) (.cse14 (= |v_P0_#t~ite11_75| |v_P0Thread1of1ForFork1_#t~ite11_10|)) (.cse15 (= |v_P0Thread1of1ForFork1_#t~mem10_10| |v_P0_#t~mem10_78|)) (.cse20 (= |v_P0_#t~ite9_71| |v_P0Thread1of1ForFork1_#t~ite9_10|)) (.cse21 (= |v_P0_#t~ite13_63| |v_P0Thread1of1ForFork1_#t~ite13_10|)) (.cse18 (= |v_P0Thread1of1ForFork1_#t~mem8_10| |v_P0_#t~mem8_74|))) (or (and (= |v_P0_#t~ite14_59| v_~__unbuffered_p0_EAX~0_67) (or (and (= |v_P0_#t~ite13_63| |v_P0_#t~ite14_59|) (or (and .cse3 .cse13 .cse14 .cse15 (= |v_P0_#t~ite9_71| |v_P0_#t~ite13_63|) .cse5 (or (and (= .cse12 |v_P0_#t~mem8_74|) (= |v_P0_#t~ite9_71| |v_P0_#t~mem8_74|) .cse11) (and (= |v_P0_#t~ite9_71| (ite (not .cse16) v_~y$w_buff0~0_190 v_~y$w_buff1~0_184)) .cse17 .cse18))) (and (or (and .cse14 .cse15 (= |v_P0_#t~ite12_67| (ite .cse11 v_~y$w_buff1~0_184 v_~y$w_buff0~0_190)) .cse5) (and (or (and (= |v_P0_#t~ite11_75| |v_P0_#t~mem10_78|) (= |v_P0_#t~mem10_78| .cse12) .cse17) (and .cse15 .cse11 (= |v_P0_#t~ite11_75| v_~y$w_buff0~0_190))) .cse19 (= |v_P0_#t~ite11_75| |v_P0_#t~ite12_67|))) .cse20 (= |v_P0_#t~ite12_67| |v_P0_#t~ite13_63|) (or (not .cse3) .cse19) .cse18)) .cse6) (and .cse13 .cse14 .cse15 .cse20 (= |v_P0_#t~ite14_59| v_~y$w_buff0~0_190) .cse21 .cse22 .cse18)) (= |v_P0Thread1of1ForFork1_#t~mem7_10| |v_P0_#t~mem7_52|) .cse23) (and .cse13 .cse14 .cse24 .cse15 .cse20 (= |v_P0_#t~ite14_59| |v_P0Thread1of1ForFork1_#t~ite14_10|) .cse21 (= .cse12 |v_P0_#t~mem7_52|) (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem7_52|) .cse18))) (= v_~y$w_buff0_used~0_342 (ite (= (ite .cse0 .cse25 (ite .cse24 .cse25 (ite (and .cse23 .cse22) 0 (ite (and .cse3 .cse23 .cse5 .cse6) (ite (or .cse11 .cse16) 1 0) .cse26)))) 0) 0 1)))))) InVars {~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_343, P0Thread1of1ForFork1_#t~mem10=|v_P0Thread1of1ForFork1_#t~mem10_10|, ~#y~0.base=|v_~#y~0.base_254|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem7=|v_P0Thread1of1ForFork1_#t~mem7_10|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#t~mem17=|v_P0Thread1of1ForFork1_#t~mem17_10|, ~y$w_buff1~0=v_~y$w_buff1~0_184, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_10|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_190, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, #memory_int=|v_#memory_int_399|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~ite14=|v_P0Thread1of1ForFork1_#t~ite14_10|, P0Thread1of1ForFork1_#t~ite13=|v_P0Thread1of1ForFork1_#t~ite13_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, P0Thread1of1ForFork1_#t~ite12=|v_P0Thread1of1ForFork1_#t~ite12_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_321, P0Thread1of1ForFork1_#t~ite11=|v_P0Thread1of1ForFork1_#t~ite11_10|, P0Thread1of1ForFork1_#t~nondet6=|v_P0Thread1of1ForFork1_#t~nondet6_10|} OutVars{~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_342, ~#y~0.base=|v_~#y~0.base_254|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, P0Thread1of1ForFork1_#t~mem16=|v_P0Thread1of1ForFork1_#t~mem16_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_88, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, ~weak$$choice1~0=v_~weak$$choice1~0_84, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_189, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork1_#t~ite18=|v_P0Thread1of1ForFork1_#t~ite18_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_116, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#t~ite15=|v_P0Thread1of1ForFork1_#t~ite15_7|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_44, ~weak$$choice0~0=v_~weak$$choice0~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_183, #memory_int=|v_#memory_int_398|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_44, ~weak$$choice2~0=v_~weak$$choice2~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_320} AuxVars[|v_P0_#t~mem8_74|, |v_P0_#t~ite14_59|, |v_P0_#t~mem7_52|, |v_P0_#t~ite9_71|, |v_P0_#t~mem10_78|, |v_P0_#t~ite12_67|, |v_P0_#t~mem17_30|, |v_P0_#t~ite11_75|, |v_P0_#t~ite13_63|, |v_P0_#t~ite18_33|] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem10, P0Thread1of1ForFork1_#t~mem7, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem16, ~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem17, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite18, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~ite15, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork1_#t~ite14, P0Thread1of1ForFork1_#t~ite13, P0Thread1of1ForFork1_#t~ite12, P0Thread1of1ForFork1_#t~ite11, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite9, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0, P0Thread1of1ForFork1_#t~nondet6] [2022-12-13 11:58:51,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L824-->L826: Formula: (= (store |v_#memory_int_25| |v_~#y~0.base_19| (store (select |v_#memory_int_25| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2)) |v_#memory_int_24|) InVars {#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_24|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [742] L791-->L793: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 11:58:51,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:58:51,981 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2043 [2022-12-13 11:58:51,981 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 222 flow [2022-12-13 11:58:51,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:58:51,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:51,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:58:51,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1649140281, now seen corresponding path program 1 times [2022-12-13 11:58:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:51,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836281813] [2022-12-13 11:58:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:52,440 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:58:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836281813] [2022-12-13 11:58:52,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836281813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:52,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:52,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:58:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615024752] [2022-12-13 11:58:52,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:52,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:58:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:52,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:58:52,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:58:52,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:58:52,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:58:52,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:52,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:58:52,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:53,171 INFO L130 PetriNetUnfolder]: 3594/5847 cut-off events. [2022-12-13 11:58:53,171 INFO L131 PetriNetUnfolder]: For 8047/8102 co-relation queries the response was YES. [2022-12-13 11:58:53,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16149 conditions, 5847 events. 3594/5847 cut-off events. For 8047/8102 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 38721 event pairs, 1147 based on Foata normal form. 102/4763 useless extension candidates. Maximal degree in co-relation 16130. Up to 2961 conditions per place. [2022-12-13 11:58:53,199 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 51 selfloop transitions, 16 changer transitions 5/80 dead transitions. [2022-12-13 11:58:53,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 492 flow [2022-12-13 11:58:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:58:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:58:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 11:58:53,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2022-12-13 11:58:53,201 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 222 flow. Second operand 5 states and 91 transitions. [2022-12-13 11:58:53,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 492 flow [2022-12-13 11:58:53,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:58:53,208 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 330 flow [2022-12-13 11:58:53,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-13 11:58:53,208 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-13 11:58:53,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:53,209 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 330 flow [2022-12-13 11:58:53,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:53,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:53,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 330 flow [2022-12-13 11:58:53,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 330 flow [2022-12-13 11:58:53,289 INFO L130 PetriNetUnfolder]: 173/575 cut-off events. [2022-12-13 11:58:53,289 INFO L131 PetriNetUnfolder]: For 1274/1309 co-relation queries the response was YES. [2022-12-13 11:58:53,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 575 events. 173/575 cut-off events. For 1274/1309 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4265 event pairs, 26 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 1709. Up to 240 conditions per place. [2022-12-13 11:58:53,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 330 flow [2022-12-13 11:58:53,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-13 11:58:53,296 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:53,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 11:58:53,296 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 330 flow [2022-12-13 11:58:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:58:53,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:53,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:53,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:58:53,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2068662799, now seen corresponding path program 1 times [2022-12-13 11:58:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:53,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082657373] [2022-12-13 11:58:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:53,714 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:58:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:53,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082657373] [2022-12-13 11:58:53,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082657373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:53,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:53,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:58:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41934512] [2022-12-13 11:58:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:53,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:58:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:58:53,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:58:53,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:58:53,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:58:53,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:53,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:58:53,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:54,548 INFO L130 PetriNetUnfolder]: 4002/6521 cut-off events. [2022-12-13 11:58:54,548 INFO L131 PetriNetUnfolder]: For 13620/13669 co-relation queries the response was YES. [2022-12-13 11:58:54,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20153 conditions, 6521 events. 4002/6521 cut-off events. For 13620/13669 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 44067 event pairs, 571 based on Foata normal form. 98/5259 useless extension candidates. Maximal degree in co-relation 20130. Up to 3192 conditions per place. [2022-12-13 11:58:54,569 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 42 selfloop transitions, 5 changer transitions 28/83 dead transitions. [2022-12-13 11:58:54,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 598 flow [2022-12-13 11:58:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:58:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:58:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-13 11:58:54,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-13 11:58:54,571 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 330 flow. Second operand 5 states and 92 transitions. [2022-12-13 11:58:54,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 598 flow [2022-12-13 11:58:54,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 583 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:54,586 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 245 flow [2022-12-13 11:58:54,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2022-12-13 11:58:54,588 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2022-12-13 11:58:54,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:54,588 INFO L89 Accepts]: Start accepts. Operand has 60 places, 42 transitions, 245 flow [2022-12-13 11:58:54,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:54,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:54,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 42 transitions, 245 flow [2022-12-13 11:58:54,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 42 transitions, 245 flow [2022-12-13 11:58:54,634 INFO L130 PetriNetUnfolder]: 91/341 cut-off events. [2022-12-13 11:58:54,635 INFO L131 PetriNetUnfolder]: For 961/970 co-relation queries the response was YES. [2022-12-13 11:58:54,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 341 events. 91/341 cut-off events. For 961/970 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2190 event pairs, 31 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 1026. Up to 134 conditions per place. [2022-12-13 11:58:54,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 42 transitions, 245 flow [2022-12-13 11:58:54,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 11:58:55,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L791-->L793: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [640] L861-->L867: Formula: (let ((.cse8 (= (mod v_~y$r_buff0_thd0~0_68 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff0_used~0_269 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_63 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_251 256) 0)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_268 256) 0))) (.cse5 (not .cse8))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (not .cse11)) (.cse1 (not .cse10)) (.cse3 (select |v_#memory_int_283| |v_~#y~0.base_210|)) (.cse6 (not .cse7))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~y$w_buff1_used~0_251) v_~y$w_buff1_used~0_250) (= (store |v_#memory_int_283| |v_~#y~0.base_210| (store .cse3 |v_~#y~0.offset_210| |v_ULTIMATE.start_main_#t~ite41#1_26|)) |v_#memory_int_282|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_250 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_67 256) 0)))) 0 v_~y$r_buff1_thd0~0_63) v_~y$r_buff1_thd0~0_62) (= v_~y$r_buff0_thd0~0_67 (ite .cse2 0 v_~y$r_buff0_thd0~0_68)) (= (ite (and .cse5 .cse6) 0 v_~y$w_buff0_used~0_269) v_~y$w_buff0_used~0_268) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem39#1_33| |v_ULTIMATE.start_main_#t~mem39#1_29|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_30| |v_ULTIMATE.start_main_#t~ite41#1_26|) (or .cse7 .cse8) (or (and .cse9 .cse0 (= v_~y$w_buff1~0_121 |v_ULTIMATE.start_main_#t~ite40#1_30|) .cse1) (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite40#1_30| |v_ULTIMATE.start_main_#t~mem39#1_33|) (= |v_ULTIMATE.start_main_#t~mem39#1_33| (select .cse3 |v_~#y~0.offset_210|))))) (and .cse5 .cse9 .cse6 (= |v_ULTIMATE.start_main_#t~ite41#1_26| v_~y$w_buff0~0_123) (= |v_ULTIMATE.start_main_#t~ite40#1_30| |v_ULTIMATE.start_main_#t~ite40#1_26|)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_210|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_269, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~y$w_buff0~0=v_~y$w_buff0~0_123, #memory_int=|v_#memory_int_283|, ~#y~0.base=|v_~#y~0.base_210|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_63, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_251} OutVars{ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_22|, ~#y~0.offset=|v_~#y~0.offset_210|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_268, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_123, #memory_int=|v_#memory_int_282|, ~#y~0.base=|v_~#y~0.base_210|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_250} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_26|, |v_ULTIMATE.start_main_#t~mem39#1_33|, |v_ULTIMATE.start_main_#t~ite40#1_30|] AssignedVars[ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~mem39#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite40#1, ~y$w_buff1_used~0] [2022-12-13 11:58:55,966 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L791-->L793: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [800] $Ultimate##0-->L776: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd1~0_84 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_342 256) 0)) (.cse25 (mod v_~y$w_buff0_used~0_343 256)) (.cse26 (mod v_~weak$$choice0~0_111 256))) (let ((.cse17 (= .cse26 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_321 256) 0)) (.cse24 (= .cse25 0)) (.cse8 (= (mod v_~weak$$choice2~0_136 256) 0)) (.cse7 (select |v_#memory_int_399| |v_~#y~0.base_254|)) (.cse4 (not .cse1)) (.cse22 (not .cse6))) (let ((.cse2 (and .cse4 .cse22)) (.cse10 (not (= (mod v_~y$w_buff1_used~0_320 256) 0))) (.cse12 (select .cse7 |v_~#y~0.offset_254|)) (.cse0 (not .cse8)) (.cse3 (= (mod v_~y$r_buff1_thd1~0_80 256) 0)) (.cse23 (not .cse24)) (.cse5 (not .cse19)) (.cse11 (not .cse17)) (.cse16 (= (mod v_~weak$$choice1~0_84 256) 0))) (and (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_44 |v_~#y~0.offset_254|) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= (ite .cse0 v_~y$w_buff1_used~0_321 (ite .cse1 v_~y$w_buff1_used~0_321 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~weak$$choice0~0_111 0)))) v_~y$w_buff1_used~0_320) (= (store |v_#memory_int_399| |v_~#y~0.base_254| (store .cse7 |v_~#y~0.offset_254| |v_P0_#t~ite18_33|)) |v_#memory_int_398|) (= v_~y$flush_delayed~0_116 0) (= v_~__unbuffered_p0_EAX$read_delayed~0_43 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork1_#t~nondet6_10| v_~weak$$choice1~0_84) (or (and (= |v_P0Thread1of1ForFork1_#t~mem17_10| |v_P0_#t~mem17_30|) (= |v_P0_#t~ite18_33| v_~y$mem_tmp~0_88) .cse0) (and (= |v_P0_#t~mem17_30| v_~__unbuffered_p0_EAX~0_67) .cse8 (= |v_P0_#t~ite18_33| |v_P0_#t~mem17_30|))) (= v_~y$w_buff1~0_184 v_~y$w_buff1~0_183) (= (ite .cse0 v_~y$r_buff1_thd1~0_80 (ite .cse1 v_~y$r_buff1_thd1~0_80 (let ((.cse9 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (ite (and (not .cse9) .cse4) 0 (ite (and .cse3 .cse4 .cse9 .cse10) (ite .cse11 v_~y$r_buff1_thd1~0_80 0) 0))))) v_~y$r_buff1_thd1~0_79) (= v_~weak$$choice2~0_136 |v_P0Thread1of1ForFork1_#t~nondet4_10|) (= v_~y$mem_tmp~0_88 .cse12) (= |v_~#y~0.base_254| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_44) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_111) (= (ite .cse0 v_~y$r_buff0_thd1~0_84 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite .cse2 0 (ite (and .cse3 .cse4 .cse10 .cse6) v_~y$r_buff0_thd1~0_84 0)))) v_~y$r_buff0_thd1~0_83) (= v_~y$w_buff0~0_189 v_~y$w_buff0~0_190) (let ((.cse13 (= |v_P0_#t~ite12_67| |v_P0Thread1of1ForFork1_#t~ite12_10|)) (.cse14 (= |v_P0_#t~ite11_75| |v_P0Thread1of1ForFork1_#t~ite11_10|)) (.cse15 (= |v_P0Thread1of1ForFork1_#t~mem10_10| |v_P0_#t~mem10_78|)) (.cse20 (= |v_P0_#t~ite9_71| |v_P0Thread1of1ForFork1_#t~ite9_10|)) (.cse21 (= |v_P0_#t~ite13_63| |v_P0Thread1of1ForFork1_#t~ite13_10|)) (.cse18 (= |v_P0Thread1of1ForFork1_#t~mem8_10| |v_P0_#t~mem8_74|))) (or (and (= |v_P0_#t~ite14_59| v_~__unbuffered_p0_EAX~0_67) (or (and (= |v_P0_#t~ite13_63| |v_P0_#t~ite14_59|) (or (and .cse3 .cse13 .cse14 .cse15 (= |v_P0_#t~ite9_71| |v_P0_#t~ite13_63|) .cse5 (or (and (= .cse12 |v_P0_#t~mem8_74|) (= |v_P0_#t~ite9_71| |v_P0_#t~mem8_74|) .cse11) (and (= |v_P0_#t~ite9_71| (ite (not .cse16) v_~y$w_buff0~0_190 v_~y$w_buff1~0_184)) .cse17 .cse18))) (and (or (and .cse14 .cse15 (= |v_P0_#t~ite12_67| (ite .cse11 v_~y$w_buff1~0_184 v_~y$w_buff0~0_190)) .cse5) (and (or (and (= |v_P0_#t~ite11_75| |v_P0_#t~mem10_78|) (= |v_P0_#t~mem10_78| .cse12) .cse17) (and .cse15 .cse11 (= |v_P0_#t~ite11_75| v_~y$w_buff0~0_190))) .cse19 (= |v_P0_#t~ite11_75| |v_P0_#t~ite12_67|))) .cse20 (= |v_P0_#t~ite12_67| |v_P0_#t~ite13_63|) (or (not .cse3) .cse19) .cse18)) .cse6) (and .cse13 .cse14 .cse15 .cse20 (= |v_P0_#t~ite14_59| v_~y$w_buff0~0_190) .cse21 .cse22 .cse18)) (= |v_P0Thread1of1ForFork1_#t~mem7_10| |v_P0_#t~mem7_52|) .cse23) (and .cse13 .cse14 .cse24 .cse15 .cse20 (= |v_P0_#t~ite14_59| |v_P0Thread1of1ForFork1_#t~ite14_10|) .cse21 (= .cse12 |v_P0_#t~mem7_52|) (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem7_52|) .cse18))) (= v_~y$w_buff0_used~0_342 (ite (= (ite .cse0 .cse25 (ite .cse24 .cse25 (ite (and .cse23 .cse22) 0 (ite (and .cse3 .cse23 .cse5 .cse6) (ite (or .cse11 .cse16) 1 0) .cse26)))) 0) 0 1)))))) InVars {~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_343, P0Thread1of1ForFork1_#t~mem10=|v_P0Thread1of1ForFork1_#t~mem10_10|, ~#y~0.base=|v_~#y~0.base_254|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem7=|v_P0Thread1of1ForFork1_#t~mem7_10|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#t~mem17=|v_P0Thread1of1ForFork1_#t~mem17_10|, ~y$w_buff1~0=v_~y$w_buff1~0_184, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_10|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_190, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, #memory_int=|v_#memory_int_399|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~ite14=|v_P0Thread1of1ForFork1_#t~ite14_10|, P0Thread1of1ForFork1_#t~ite13=|v_P0Thread1of1ForFork1_#t~ite13_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, P0Thread1of1ForFork1_#t~ite12=|v_P0Thread1of1ForFork1_#t~ite12_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_321, P0Thread1of1ForFork1_#t~ite11=|v_P0Thread1of1ForFork1_#t~ite11_10|, P0Thread1of1ForFork1_#t~nondet6=|v_P0Thread1of1ForFork1_#t~nondet6_10|} OutVars{~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_342, ~#y~0.base=|v_~#y~0.base_254|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, P0Thread1of1ForFork1_#t~mem16=|v_P0Thread1of1ForFork1_#t~mem16_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_88, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, ~weak$$choice1~0=v_~weak$$choice1~0_84, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_189, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork1_#t~ite18=|v_P0Thread1of1ForFork1_#t~ite18_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_116, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#t~ite15=|v_P0Thread1of1ForFork1_#t~ite15_7|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_44, ~weak$$choice0~0=v_~weak$$choice0~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_183, #memory_int=|v_#memory_int_398|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_44, ~weak$$choice2~0=v_~weak$$choice2~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_320} AuxVars[|v_P0_#t~mem8_74|, |v_P0_#t~ite14_59|, |v_P0_#t~mem7_52|, |v_P0_#t~ite9_71|, |v_P0_#t~mem10_78|, |v_P0_#t~ite12_67|, |v_P0_#t~mem17_30|, |v_P0_#t~ite11_75|, |v_P0_#t~ite13_63|, |v_P0_#t~ite18_33|] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem10, P0Thread1of1ForFork1_#t~mem7, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem16, ~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem17, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite18, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~ite15, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork1_#t~ite14, P0Thread1of1ForFork1_#t~ite13, P0Thread1of1ForFork1_#t~ite12, P0Thread1of1ForFork1_#t~ite11, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite9, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0, P0Thread1of1ForFork1_#t~nondet6] [2022-12-13 11:58:57,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L791-->L793: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [843] L854-3-->L856-2: Formula: (and (= (store |v_#memory_int_441| |v_ULTIMATE.start_main_~#t1803~0#1.base_20| (store (select |v_#memory_int_441| |v_ULTIMATE.start_main_~#t1803~0#1.base_20|) |v_ULTIMATE.start_main_~#t1803~0#1.offset_20| |v_ULTIMATE.start_main_#t~pre37#1_41|)) |v_#memory_int_440|) (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre37#1_41|) (not (= |v_ULTIMATE.start_main_~#t1803~0#1.base_20| 0)) (< |v_#StackHeapBarrier_35| |v_ULTIMATE.start_main_~#t1803~0#1.base_20|) (= (select |v_#valid_84| |v_ULTIMATE.start_main_~#t1803~0#1.base_20|) 0) (= (store |v_#length_73| |v_ULTIMATE.start_main_~#t1803~0#1.base_20| 4) |v_#length_72|) (= |v_ULTIMATE.start_main_~#t1803~0#1.offset_20| 0) (= |v_#valid_83| (store |v_#valid_84| |v_ULTIMATE.start_main_~#t1803~0#1.base_20| 1)) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_35|, #pthreadsForks=|v_#pthreadsForks_51|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_441|, #length=|v_#length_73|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_41|, ULTIMATE.start_main_~#t1803~0#1.offset=|v_ULTIMATE.start_main_~#t1803~0#1.offset_20|, #StackHeapBarrier=|v_#StackHeapBarrier_35|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_25|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_13|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_440|, #length=|v_#length_72|, ULTIMATE.start_main_~#t1803~0#1.base=|v_ULTIMATE.start_main_~#t1803~0#1.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_~#t1803~0#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_main_#t~nondet36#1, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1803~0#1.base] [2022-12-13 11:58:57,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L791-->L793: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [797] $Ultimate##0-->L824: Formula: (let ((.cse13 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_105 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_339 256) 0))) (let ((.cse11 (not .cse16)) (.cse12 (not .cse15)) (.cse1 (and .cse15 .cse5)) (.cse3 (and .cse15 .cse13)) (.cse8 (= (mod v_~weak$$choice2~0_134 256) 0)) (.cse7 (select |v_#memory_int_393| |v_~#y~0.base_250|))) (let ((.cse9 (select .cse7 |v_~#y~0.offset_250|)) (.cse6 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse0 (not .cse8)) (.cse14 (or .cse1 .cse3 .cse16)) (.cse10 (and .cse11 .cse12))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~y$flush_delayed~0_112 0) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~y$w_buff1~0_180 v_~y$w_buff1~0_179) (= (ite .cse0 v_~y$r_buff1_thd3~0_105 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_117 256) 0))) (or (and .cse4 .cse5) .cse2 (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_105 0)) v_~y$r_buff1_thd3~0_104) (= (store |v_#memory_int_393| |v_~#y~0.base_250| (store .cse7 |v_~#y~0.offset_250| |v_P2_#t~ite29_31|)) |v_#memory_int_392|) (or (and .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_30|) (= |v_P2_#t~ite29_31| v_~y$mem_tmp~0_84)) (and (= |v_P2_#t~ite29_31| |v_P2_#t~mem28_30|) (= |v_P2_#t~mem28_30| v_~__unbuffered_p2_EAX~0_42) .cse8)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~weak$$choice2~0_134 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (= v_~y$w_buff0~0_186 v_~y$w_buff0~0_185) (= v_~y$mem_tmp~0_84 .cse9) (or (and (= (ite .cse10 v_~y$w_buff0~0_186 v_~y$w_buff1~0_180) v_~__unbuffered_p2_EAX~0_42) .cse11 (or (not .cse5) .cse12) (or .cse12 (not .cse13)) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_46|)) (and .cse14 (= |v_P2_#t~mem25_46| v_~__unbuffered_p2_EAX~0_42) (= |v_P2_#t~mem25_46| .cse9))) (= (ite .cse0 v_~y$r_buff0_thd3~0_118 (ite (or .cse1 .cse2 (and .cse6 .cse15)) v_~y$r_buff0_thd3~0_118 (ite (and .cse12 (not .cse2)) 0 v_~y$r_buff0_thd3~0_118))) v_~y$r_buff0_thd3~0_117) (= v_~y$w_buff0_used~0_338 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse14 v_~y$w_buff0_used~0_339 (ite .cse10 0 v_~y$w_buff0_used~0_339)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_186, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_84, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_179, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_134, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P2_#t~mem28_30|, |v_P2_#t~ite29_31|, |v_P2_#t~mem25_46|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 11:58:57,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:58:57,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3385 [2022-12-13 11:58:57,973 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 278 flow [2022-12-13 11:58:57,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:58:57,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:57,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:57,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:58:57,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1602952725, now seen corresponding path program 1 times [2022-12-13 11:58:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:57,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029794208] [2022-12-13 11:58:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:58,374 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:58:58,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:58,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029794208] [2022-12-13 11:58:58,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029794208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:58,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:58,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457696594] [2022-12-13 11:58:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:58,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:58,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:58,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:58,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 11:58:58,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:58:58,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:58,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 11:58:58,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:58,810 INFO L130 PetriNetUnfolder]: 2150/3500 cut-off events. [2022-12-13 11:58:58,810 INFO L131 PetriNetUnfolder]: For 10659/10683 co-relation queries the response was YES. [2022-12-13 11:58:58,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 3500 events. 2150/3500 cut-off events. For 10659/10683 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 20809 event pairs, 1260 based on Foata normal form. 16/2817 useless extension candidates. Maximal degree in co-relation 11889. Up to 2842 conditions per place. [2022-12-13 11:58:58,831 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 34 selfloop transitions, 11 changer transitions 1/54 dead transitions. [2022-12-13 11:58:58,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 422 flow [2022-12-13 11:58:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:58:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:58:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 11:58:58,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 11:58:58,832 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 278 flow. Second operand 4 states and 66 transitions. [2022-12-13 11:58:58,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 422 flow [2022-12-13 11:58:58,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 379 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 11:58:58,842 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 318 flow [2022-12-13 11:58:58,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 11:58:58,843 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-13 11:58:58,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:58,843 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 318 flow [2022-12-13 11:58:58,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:58,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:58,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 318 flow [2022-12-13 11:58:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 318 flow [2022-12-13 11:58:58,897 INFO L130 PetriNetUnfolder]: 143/430 cut-off events. [2022-12-13 11:58:58,897 INFO L131 PetriNetUnfolder]: For 882/916 co-relation queries the response was YES. [2022-12-13 11:58:58,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 430 events. 143/430 cut-off events. For 882/916 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2715 event pairs, 9 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 1399. Up to 185 conditions per place. [2022-12-13 11:58:58,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 318 flow [2022-12-13 11:58:58,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-13 11:58:59,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] L791-->L867: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_206 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_205 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_599 256) 0)) (.cse1 (not .cse3)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_618 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_619 256) 0))) (let ((.cse2 (not .cse4)) (.cse0 (and .cse1 .cse10)) (.cse6 (not .cse8)) (.cse5 (not .cse9))) (and (= (store |v_#memory_int_778| |v_~#y~0.base_392| (store (select |v_#memory_int_778| |v_~#y~0.base_392|) |v_~#y~0.offset_392| |v_ULTIMATE.start_main_#t~ite41#1_117|)) |v_#memory_int_776|) (= v_~y$r_buff0_thd0~0_205 (ite .cse0 0 v_~y$r_buff0_thd0~0_206)) (= v_~y$w_buff0_used~0_618 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_619)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem39#1_144| |v_ULTIMATE.start_main_#t~mem39#1_142|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite41#1_117| |v_ULTIMATE.start_main_#t~ite40#1_139|) (or (and (= v_~y$w_buff1~0_405 |v_ULTIMATE.start_main_#t~ite40#1_139|) .cse5 .cse6 .cse7) (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem39#1_142| |v_ULTIMATE.start_main_#t~ite40#1_139|) (= |v_ULTIMATE.start_main_#t~mem39#1_142| 1)))) (and .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite40#1_139| |v_ULTIMATE.start_main_#t~ite40#1_141|) .cse7 (= |v_ULTIMATE.start_main_#t~ite41#1_117| v_~y$w_buff0~0_409)))) (= (ite (or .cse0 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_599) v_~y$w_buff1_used~0_598) (= v_~y$r_buff1_thd0~0_204 (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_205 256) 0))) (and .cse5 (not (= (mod v_~y$w_buff1_used~0_598 256) 0)))) 0 v_~y$r_buff1_thd0~0_205)))))) InVars {~#y~0.offset=|v_~#y~0.offset_392|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_619, ~y$w_buff1~0=v_~y$w_buff1~0_405, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_206, ~y$w_buff0~0=v_~y$w_buff0~0_409, #memory_int=|v_#memory_int_778|, ~#y~0.base=|v_~#y~0.base_392|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_144|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_205, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_141|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_599} OutVars{ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_116|, ~#y~0.offset=|v_~#y~0.offset_392|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_618, ~y$w_buff1~0=v_~y$w_buff1~0_405, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_205, ~y$w_buff0~0=v_~y$w_buff0~0_409, #memory_int=|v_#memory_int_776|, ~#y~0.base=|v_~#y~0.base_392|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_598} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_139|, |v_ULTIMATE.start_main_#t~ite41#1_117|, |v_ULTIMATE.start_main_#t~mem39#1_142|] AssignedVars[ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~mem39#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite40#1, ~y$w_buff1_used~0] and [743] L793-->L801: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd2~0_36 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_34 256) 0)) (.cse1 (not .cse4)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_260 256) 0))) (.cse8 (= (mod v_~y$w_buff1_used~0_243 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_261 256) 0))) (let ((.cse0 (not .cse3)) (.cse5 (not .cse8)) (.cse10 (and .cse1 .cse11)) (.cse6 (not .cse9)) (.cse7 (select |v_#memory_int_275| |v_~#y~0.base_206|))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_261) v_~y$w_buff0_used~0_260) (let ((.cse2 (= |v_P1Thread1of1ForFork2_#t~mem19_1| |v_P1_#t~mem19_32|))) (or (and .cse0 .cse1 .cse2 (= |v_P1Thread1of1ForFork2_#t~ite20_1| |v_P1_#t~ite20_29|) (= |v_P1_#t~ite21_25| v_~y$w_buff0~0_119)) (and (or .cse3 .cse4) (or (and .cse2 .cse5 (= v_~y$w_buff1~0_117 |v_P1_#t~ite20_29|) .cse6) (and (= (select .cse7 |v_~#y~0.offset_206|) |v_P1_#t~mem19_32|) (= |v_P1_#t~ite20_29| |v_P1_#t~mem19_32|) (or .cse8 .cse9))) (= |v_P1_#t~ite20_29| |v_P1_#t~ite21_25|)))) (= v_~y$w_buff1_used~0_242 (ite (or (and .cse5 .cse6) .cse10) 0 v_~y$w_buff1_used~0_243)) (= (ite .cse10 0 v_~y$r_buff0_thd2~0_36) v_~y$r_buff0_thd2~0_35) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_242 256) 0)) .cse6) (and (not (= (mod v_~y$r_buff0_thd2~0_35 256) 0)) .cse11)) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= (store |v_#memory_int_275| |v_~#y~0.base_206| (store .cse7 |v_~#y~0.offset_206| |v_P1_#t~ite21_25|)) |v_#memory_int_274|))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_261, ~y$w_buff1~0=v_~y$w_buff1~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, #memory_int=|v_#memory_int_275|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_1|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~mem19=|v_P1Thread1of1ForFork2_#t~mem19_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_243} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_260, ~y$w_buff1~0=v_~y$w_buff1~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, #memory_int=|v_#memory_int_274|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_242} AuxVars[|v_P1_#t~mem19_32|, |v_P1_#t~ite20_29|, |v_P1_#t~ite21_25|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem19] [2022-12-13 11:59:00,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] L791-->L867: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_206 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_205 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_599 256) 0)) (.cse1 (not .cse3)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_618 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_619 256) 0))) (let ((.cse2 (not .cse4)) (.cse0 (and .cse1 .cse10)) (.cse6 (not .cse8)) (.cse5 (not .cse9))) (and (= (store |v_#memory_int_778| |v_~#y~0.base_392| (store (select |v_#memory_int_778| |v_~#y~0.base_392|) |v_~#y~0.offset_392| |v_ULTIMATE.start_main_#t~ite41#1_117|)) |v_#memory_int_776|) (= v_~y$r_buff0_thd0~0_205 (ite .cse0 0 v_~y$r_buff0_thd0~0_206)) (= v_~y$w_buff0_used~0_618 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_619)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem39#1_144| |v_ULTIMATE.start_main_#t~mem39#1_142|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite41#1_117| |v_ULTIMATE.start_main_#t~ite40#1_139|) (or (and (= v_~y$w_buff1~0_405 |v_ULTIMATE.start_main_#t~ite40#1_139|) .cse5 .cse6 .cse7) (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem39#1_142| |v_ULTIMATE.start_main_#t~ite40#1_139|) (= |v_ULTIMATE.start_main_#t~mem39#1_142| 1)))) (and .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite40#1_139| |v_ULTIMATE.start_main_#t~ite40#1_141|) .cse7 (= |v_ULTIMATE.start_main_#t~ite41#1_117| v_~y$w_buff0~0_409)))) (= (ite (or .cse0 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_599) v_~y$w_buff1_used~0_598) (= v_~y$r_buff1_thd0~0_204 (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_205 256) 0))) (and .cse5 (not (= (mod v_~y$w_buff1_used~0_598 256) 0)))) 0 v_~y$r_buff1_thd0~0_205)))))) InVars {~#y~0.offset=|v_~#y~0.offset_392|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_619, ~y$w_buff1~0=v_~y$w_buff1~0_405, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_206, ~y$w_buff0~0=v_~y$w_buff0~0_409, #memory_int=|v_#memory_int_778|, ~#y~0.base=|v_~#y~0.base_392|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_144|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_205, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_141|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_599} OutVars{ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_116|, ~#y~0.offset=|v_~#y~0.offset_392|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_618, ~y$w_buff1~0=v_~y$w_buff1~0_405, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_205, ~y$w_buff0~0=v_~y$w_buff0~0_409, #memory_int=|v_#memory_int_776|, ~#y~0.base=|v_~#y~0.base_392|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_598} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_139|, |v_ULTIMATE.start_main_#t~ite41#1_117|, |v_ULTIMATE.start_main_#t~mem39#1_142|] AssignedVars[ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~mem39#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite40#1, ~y$w_buff1_used~0] and [800] $Ultimate##0-->L776: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd1~0_84 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_342 256) 0)) (.cse25 (mod v_~y$w_buff0_used~0_343 256)) (.cse26 (mod v_~weak$$choice0~0_111 256))) (let ((.cse17 (= .cse26 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_321 256) 0)) (.cse24 (= .cse25 0)) (.cse8 (= (mod v_~weak$$choice2~0_136 256) 0)) (.cse7 (select |v_#memory_int_399| |v_~#y~0.base_254|)) (.cse4 (not .cse1)) (.cse22 (not .cse6))) (let ((.cse2 (and .cse4 .cse22)) (.cse10 (not (= (mod v_~y$w_buff1_used~0_320 256) 0))) (.cse12 (select .cse7 |v_~#y~0.offset_254|)) (.cse0 (not .cse8)) (.cse3 (= (mod v_~y$r_buff1_thd1~0_80 256) 0)) (.cse23 (not .cse24)) (.cse5 (not .cse19)) (.cse11 (not .cse17)) (.cse16 (= (mod v_~weak$$choice1~0_84 256) 0))) (and (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_44 |v_~#y~0.offset_254|) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= (ite .cse0 v_~y$w_buff1_used~0_321 (ite .cse1 v_~y$w_buff1_used~0_321 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~weak$$choice0~0_111 0)))) v_~y$w_buff1_used~0_320) (= (store |v_#memory_int_399| |v_~#y~0.base_254| (store .cse7 |v_~#y~0.offset_254| |v_P0_#t~ite18_33|)) |v_#memory_int_398|) (= v_~y$flush_delayed~0_116 0) (= v_~__unbuffered_p0_EAX$read_delayed~0_43 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork1_#t~nondet6_10| v_~weak$$choice1~0_84) (or (and (= |v_P0Thread1of1ForFork1_#t~mem17_10| |v_P0_#t~mem17_30|) (= |v_P0_#t~ite18_33| v_~y$mem_tmp~0_88) .cse0) (and (= |v_P0_#t~mem17_30| v_~__unbuffered_p0_EAX~0_67) .cse8 (= |v_P0_#t~ite18_33| |v_P0_#t~mem17_30|))) (= v_~y$w_buff1~0_184 v_~y$w_buff1~0_183) (= (ite .cse0 v_~y$r_buff1_thd1~0_80 (ite .cse1 v_~y$r_buff1_thd1~0_80 (let ((.cse9 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (ite (and (not .cse9) .cse4) 0 (ite (and .cse3 .cse4 .cse9 .cse10) (ite .cse11 v_~y$r_buff1_thd1~0_80 0) 0))))) v_~y$r_buff1_thd1~0_79) (= v_~weak$$choice2~0_136 |v_P0Thread1of1ForFork1_#t~nondet4_10|) (= v_~y$mem_tmp~0_88 .cse12) (= |v_~#y~0.base_254| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_44) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_111) (= (ite .cse0 v_~y$r_buff0_thd1~0_84 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite .cse2 0 (ite (and .cse3 .cse4 .cse10 .cse6) v_~y$r_buff0_thd1~0_84 0)))) v_~y$r_buff0_thd1~0_83) (= v_~y$w_buff0~0_189 v_~y$w_buff0~0_190) (let ((.cse13 (= |v_P0_#t~ite12_67| |v_P0Thread1of1ForFork1_#t~ite12_10|)) (.cse14 (= |v_P0_#t~ite11_75| |v_P0Thread1of1ForFork1_#t~ite11_10|)) (.cse15 (= |v_P0Thread1of1ForFork1_#t~mem10_10| |v_P0_#t~mem10_78|)) (.cse20 (= |v_P0_#t~ite9_71| |v_P0Thread1of1ForFork1_#t~ite9_10|)) (.cse21 (= |v_P0_#t~ite13_63| |v_P0Thread1of1ForFork1_#t~ite13_10|)) (.cse18 (= |v_P0Thread1of1ForFork1_#t~mem8_10| |v_P0_#t~mem8_74|))) (or (and (= |v_P0_#t~ite14_59| v_~__unbuffered_p0_EAX~0_67) (or (and (= |v_P0_#t~ite13_63| |v_P0_#t~ite14_59|) (or (and .cse3 .cse13 .cse14 .cse15 (= |v_P0_#t~ite9_71| |v_P0_#t~ite13_63|) .cse5 (or (and (= .cse12 |v_P0_#t~mem8_74|) (= |v_P0_#t~ite9_71| |v_P0_#t~mem8_74|) .cse11) (and (= |v_P0_#t~ite9_71| (ite (not .cse16) v_~y$w_buff0~0_190 v_~y$w_buff1~0_184)) .cse17 .cse18))) (and (or (and .cse14 .cse15 (= |v_P0_#t~ite12_67| (ite .cse11 v_~y$w_buff1~0_184 v_~y$w_buff0~0_190)) .cse5) (and (or (and (= |v_P0_#t~ite11_75| |v_P0_#t~mem10_78|) (= |v_P0_#t~mem10_78| .cse12) .cse17) (and .cse15 .cse11 (= |v_P0_#t~ite11_75| v_~y$w_buff0~0_190))) .cse19 (= |v_P0_#t~ite11_75| |v_P0_#t~ite12_67|))) .cse20 (= |v_P0_#t~ite12_67| |v_P0_#t~ite13_63|) (or (not .cse3) .cse19) .cse18)) .cse6) (and .cse13 .cse14 .cse15 .cse20 (= |v_P0_#t~ite14_59| v_~y$w_buff0~0_190) .cse21 .cse22 .cse18)) (= |v_P0Thread1of1ForFork1_#t~mem7_10| |v_P0_#t~mem7_52|) .cse23) (and .cse13 .cse14 .cse24 .cse15 .cse20 (= |v_P0_#t~ite14_59| |v_P0Thread1of1ForFork1_#t~ite14_10|) .cse21 (= .cse12 |v_P0_#t~mem7_52|) (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem7_52|) .cse18))) (= v_~y$w_buff0_used~0_342 (ite (= (ite .cse0 .cse25 (ite .cse24 .cse25 (ite (and .cse23 .cse22) 0 (ite (and .cse3 .cse23 .cse5 .cse6) (ite (or .cse11 .cse16) 1 0) .cse26)))) 0) 0 1)))))) InVars {~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_343, P0Thread1of1ForFork1_#t~mem10=|v_P0Thread1of1ForFork1_#t~mem10_10|, ~#y~0.base=|v_~#y~0.base_254|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem7=|v_P0Thread1of1ForFork1_#t~mem7_10|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#t~mem17=|v_P0Thread1of1ForFork1_#t~mem17_10|, ~y$w_buff1~0=v_~y$w_buff1~0_184, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_10|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_190, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, #memory_int=|v_#memory_int_399|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~ite14=|v_P0Thread1of1ForFork1_#t~ite14_10|, P0Thread1of1ForFork1_#t~ite13=|v_P0Thread1of1ForFork1_#t~ite13_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, P0Thread1of1ForFork1_#t~ite12=|v_P0Thread1of1ForFork1_#t~ite12_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_321, P0Thread1of1ForFork1_#t~ite11=|v_P0Thread1of1ForFork1_#t~ite11_10|, P0Thread1of1ForFork1_#t~nondet6=|v_P0Thread1of1ForFork1_#t~nondet6_10|} OutVars{~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_342, ~#y~0.base=|v_~#y~0.base_254|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, P0Thread1of1ForFork1_#t~mem16=|v_P0Thread1of1ForFork1_#t~mem16_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_88, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, ~weak$$choice1~0=v_~weak$$choice1~0_84, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_189, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork1_#t~ite18=|v_P0Thread1of1ForFork1_#t~ite18_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_116, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#t~ite15=|v_P0Thread1of1ForFork1_#t~ite15_7|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_44, ~weak$$choice0~0=v_~weak$$choice0~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_183, #memory_int=|v_#memory_int_398|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_44, ~weak$$choice2~0=v_~weak$$choice2~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_320} AuxVars[|v_P0_#t~mem8_74|, |v_P0_#t~ite14_59|, |v_P0_#t~mem7_52|, |v_P0_#t~ite9_71|, |v_P0_#t~mem10_78|, |v_P0_#t~ite12_67|, |v_P0_#t~mem17_30|, |v_P0_#t~ite11_75|, |v_P0_#t~ite13_63|, |v_P0_#t~ite18_33|] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem10, P0Thread1of1ForFork1_#t~mem7, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem16, ~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem17, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite18, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~ite15, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork1_#t~ite14, P0Thread1of1ForFork1_#t~ite13, P0Thread1of1ForFork1_#t~ite12, P0Thread1of1ForFork1_#t~ite11, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite9, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0, P0Thread1of1ForFork1_#t~nondet6] [2022-12-13 11:59:03,157 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] L791-->L867: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_206 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_205 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_599 256) 0)) (.cse1 (not .cse3)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_618 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_619 256) 0))) (let ((.cse2 (not .cse4)) (.cse0 (and .cse1 .cse10)) (.cse6 (not .cse8)) (.cse5 (not .cse9))) (and (= (store |v_#memory_int_778| |v_~#y~0.base_392| (store (select |v_#memory_int_778| |v_~#y~0.base_392|) |v_~#y~0.offset_392| |v_ULTIMATE.start_main_#t~ite41#1_117|)) |v_#memory_int_776|) (= v_~y$r_buff0_thd0~0_205 (ite .cse0 0 v_~y$r_buff0_thd0~0_206)) (= v_~y$w_buff0_used~0_618 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_619)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem39#1_144| |v_ULTIMATE.start_main_#t~mem39#1_142|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite41#1_117| |v_ULTIMATE.start_main_#t~ite40#1_139|) (or (and (= v_~y$w_buff1~0_405 |v_ULTIMATE.start_main_#t~ite40#1_139|) .cse5 .cse6 .cse7) (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem39#1_142| |v_ULTIMATE.start_main_#t~ite40#1_139|) (= |v_ULTIMATE.start_main_#t~mem39#1_142| 1)))) (and .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite40#1_139| |v_ULTIMATE.start_main_#t~ite40#1_141|) .cse7 (= |v_ULTIMATE.start_main_#t~ite41#1_117| v_~y$w_buff0~0_409)))) (= (ite (or .cse0 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_599) v_~y$w_buff1_used~0_598) (= v_~y$r_buff1_thd0~0_204 (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_205 256) 0))) (and .cse5 (not (= (mod v_~y$w_buff1_used~0_598 256) 0)))) 0 v_~y$r_buff1_thd0~0_205)))))) InVars {~#y~0.offset=|v_~#y~0.offset_392|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_619, ~y$w_buff1~0=v_~y$w_buff1~0_405, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_206, ~y$w_buff0~0=v_~y$w_buff0~0_409, #memory_int=|v_#memory_int_778|, ~#y~0.base=|v_~#y~0.base_392|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_144|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_205, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_141|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_599} OutVars{ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_116|, ~#y~0.offset=|v_~#y~0.offset_392|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_618, ~y$w_buff1~0=v_~y$w_buff1~0_405, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_205, ~y$w_buff0~0=v_~y$w_buff0~0_409, #memory_int=|v_#memory_int_776|, ~#y~0.base=|v_~#y~0.base_392|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_598} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_139|, |v_ULTIMATE.start_main_#t~ite41#1_117|, |v_ULTIMATE.start_main_#t~mem39#1_142|] AssignedVars[ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~mem39#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite40#1, ~y$w_buff1_used~0] and [797] $Ultimate##0-->L824: Formula: (let ((.cse13 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_105 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_339 256) 0))) (let ((.cse11 (not .cse16)) (.cse12 (not .cse15)) (.cse1 (and .cse15 .cse5)) (.cse3 (and .cse15 .cse13)) (.cse8 (= (mod v_~weak$$choice2~0_134 256) 0)) (.cse7 (select |v_#memory_int_393| |v_~#y~0.base_250|))) (let ((.cse9 (select .cse7 |v_~#y~0.offset_250|)) (.cse6 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_338 256) 0)) (.cse0 (not .cse8)) (.cse14 (or .cse1 .cse3 .cse16)) (.cse10 (and .cse11 .cse12))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~y$flush_delayed~0_112 0) (= v_~y$w_buff1_used~0_316 (ite .cse0 v_~y$w_buff1_used~0_317 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_317 0))) (= v_~y$w_buff1~0_180 v_~y$w_buff1~0_179) (= (ite .cse0 v_~y$r_buff1_thd3~0_105 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_117 256) 0))) (or (and .cse4 .cse5) .cse2 (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_105 0)) v_~y$r_buff1_thd3~0_104) (= (store |v_#memory_int_393| |v_~#y~0.base_250| (store .cse7 |v_~#y~0.offset_250| |v_P2_#t~ite29_31|)) |v_#memory_int_392|) (or (and .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_30|) (= |v_P2_#t~ite29_31| v_~y$mem_tmp~0_84)) (and (= |v_P2_#t~ite29_31| |v_P2_#t~mem28_30|) (= |v_P2_#t~mem28_30| v_~__unbuffered_p2_EAX~0_42) .cse8)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~weak$$choice2~0_134 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (= v_~y$w_buff0~0_186 v_~y$w_buff0~0_185) (= v_~y$mem_tmp~0_84 .cse9) (or (and (= (ite .cse10 v_~y$w_buff0~0_186 v_~y$w_buff1~0_180) v_~__unbuffered_p2_EAX~0_42) .cse11 (or (not .cse5) .cse12) (or .cse12 (not .cse13)) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_46|)) (and .cse14 (= |v_P2_#t~mem25_46| v_~__unbuffered_p2_EAX~0_42) (= |v_P2_#t~mem25_46| .cse9))) (= (ite .cse0 v_~y$r_buff0_thd3~0_118 (ite (or .cse1 .cse2 (and .cse6 .cse15)) v_~y$r_buff0_thd3~0_118 (ite (and .cse12 (not .cse2)) 0 v_~y$r_buff0_thd3~0_118))) v_~y$r_buff0_thd3~0_117) (= v_~y$w_buff0_used~0_338 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse14 v_~y$w_buff0_used~0_339 (ite .cse10 0 v_~y$w_buff0_used~0_339)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_186, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, ~#y~0.base=|v_~#y~0.base_250|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_84, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, ~y$w_buff0~0=v_~y$w_buff0~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_179, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_134, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P2_#t~mem28_30|, |v_P2_#t~ite29_31|, |v_P2_#t~mem25_46|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 11:59:05,088 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:59:05,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6246 [2022-12-13 11:59:05,089 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 330 flow [2022-12-13 11:59:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:59:05,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:05,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:05,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:59:05,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:05,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2070838061, now seen corresponding path program 2 times [2022-12-13 11:59:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:05,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063948298] [2022-12-13 11:59:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:05,768 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:59:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:05,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063948298] [2022-12-13 11:59:05,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063948298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:05,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:05,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:59:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459931353] [2022-12-13 11:59:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:59:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:59:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:59:05,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2022-12-13 11:59:05,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:59:05,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:05,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2022-12-13 11:59:05,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:06,343 INFO L130 PetriNetUnfolder]: 2062/3331 cut-off events. [2022-12-13 11:59:06,344 INFO L131 PetriNetUnfolder]: For 8128/8149 co-relation queries the response was YES. [2022-12-13 11:59:06,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11605 conditions, 3331 events. 2062/3331 cut-off events. For 8128/8149 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 19851 event pairs, 445 based on Foata normal form. 16/2677 useless extension candidates. Maximal degree in co-relation 11583. Up to 1959 conditions per place. [2022-12-13 11:59:06,354 INFO L137 encePairwiseOnDemand]: 20/37 looper letters, 34 selfloop transitions, 20 changer transitions 0/62 dead transitions. [2022-12-13 11:59:06,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 494 flow [2022-12-13 11:59:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:59:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:59:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 11:59:06,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2022-12-13 11:59:06,355 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 330 flow. Second operand 5 states and 87 transitions. [2022-12-13 11:59:06,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 494 flow [2022-12-13 11:59:06,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 472 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 11:59:06,360 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 372 flow [2022-12-13 11:59:06,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 11:59:06,360 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-13 11:59:06,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:06,360 INFO L89 Accepts]: Start accepts. Operand has 56 places, 48 transitions, 372 flow [2022-12-13 11:59:06,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:06,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:06,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 372 flow [2022-12-13 11:59:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 372 flow [2022-12-13 11:59:06,416 INFO L130 PetriNetUnfolder]: 137/431 cut-off events. [2022-12-13 11:59:06,416 INFO L131 PetriNetUnfolder]: For 1185/1238 co-relation queries the response was YES. [2022-12-13 11:59:06,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 431 events. 137/431 cut-off events. For 1185/1238 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2863 event pairs, 12 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 1432. Up to 175 conditions per place. [2022-12-13 11:59:06,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 372 flow [2022-12-13 11:59:06,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-13 11:59:06,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:59:06,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-13 11:59:06,741 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 374 flow [2022-12-13 11:59:06,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:59:06,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:06,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:06,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:59:06,741 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1312084561, now seen corresponding path program 1 times [2022-12-13 11:59:06,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:06,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417846152] [2022-12-13 11:59:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:06,868 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:59:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:06,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417846152] [2022-12-13 11:59:06,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417846152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:06,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:06,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:59:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058988990] [2022-12-13 11:59:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:06,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:59:06,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:06,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:59:06,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:59:06,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2022-12-13 11:59:06,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:06,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:06,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2022-12-13 11:59:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:07,479 INFO L130 PetriNetUnfolder]: 3215/4975 cut-off events. [2022-12-13 11:59:07,479 INFO L131 PetriNetUnfolder]: For 15678/15894 co-relation queries the response was YES. [2022-12-13 11:59:07,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17830 conditions, 4975 events. 3215/4975 cut-off events. For 15678/15894 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 29749 event pairs, 670 based on Foata normal form. 104/3480 useless extension candidates. Maximal degree in co-relation 17806. Up to 4750 conditions per place. [2022-12-13 11:59:07,495 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 59 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2022-12-13 11:59:07,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 686 flow [2022-12-13 11:59:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:59:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:59:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 11:59:07,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-13 11:59:07,496 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 374 flow. Second operand 3 states and 72 transitions. [2022-12-13 11:59:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 686 flow [2022-12-13 11:59:07,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:59:07,502 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 410 flow [2022-12-13 11:59:07,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2022-12-13 11:59:07,502 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2022-12-13 11:59:07,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:07,502 INFO L89 Accepts]: Start accepts. Operand has 57 places, 56 transitions, 410 flow [2022-12-13 11:59:07,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:07,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:07,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 56 transitions, 410 flow [2022-12-13 11:59:07,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 410 flow [2022-12-13 11:59:07,700 INFO L130 PetriNetUnfolder]: 1328/2458 cut-off events. [2022-12-13 11:59:07,700 INFO L131 PetriNetUnfolder]: For 3008/3184 co-relation queries the response was YES. [2022-12-13 11:59:07,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 2458 events. 1328/2458 cut-off events. For 3008/3184 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 18250 event pairs, 390 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 6926. Up to 1603 conditions per place. [2022-12-13 11:59:07,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 56 transitions, 410 flow [2022-12-13 11:59:07,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 11:59:07,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] L856-3-->L861: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~main$tmp_guard0~0_36 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_81) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_23|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [866] L791-->L824: Formula: (let ((.cse18 (= (mod v_~y$w_buff0_used~0_652 256) 0)) (.cse17 (= (mod v_~y$r_buff0_thd0~0_222 256) 0))) (let ((.cse15 (not .cse17)) (.cse16 (not .cse18))) (let ((.cse24 (ite (and .cse15 .cse16) 0 v_~y$w_buff0_used~0_652))) (let ((.cse27 (= (mod .cse24 256) 0))) (let ((.cse7 (not .cse27)) (.cse20 (= (mod v_~y$w_buff1_used~0_632 256) 0)) (.cse19 (= (mod v_~y$r_buff1_thd0~0_221 256) 0))) (let ((.cse21 (not .cse19)) (.cse22 (not .cse20)) (.cse13 (and .cse7 .cse15))) (let ((.cse10 (ite (or (and .cse21 .cse22) .cse13) 0 v_~y$w_buff1_used~0_632))) (let ((.cse26 (= (mod .cse10 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd3~0_177 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd3~0_194 256) 0))) (let ((.cse25 (= (mod v_~weak$$choice2~0_244 256) 0)) (.cse8 (not .cse23)) (.cse11 (and .cse3 .cse23)) (.cse12 (and .cse26 .cse23))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_630 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_650 256) 0)) (.cse5 (or .cse11 .cse12 .cse27)) (.cse6 (and .cse8 .cse7)) (.cse9 (not .cse26)) (.cse0 (not .cse25))) (and (= v_~y$flush_delayed~0_224 0) (= (ite .cse0 v_~y$r_buff1_thd3~0_177 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd3~0_193 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~y$r_buff1_thd3~0_177 0)) v_~y$r_buff1_thd3~0_176) (= |v_P2Thread1of1ForFork0_#t~nondet22_34| v_~weak$$choice0~0_219) (or (and (= v_~y$mem_tmp~0_196 |v_P2_#t~mem25_66|) (= |v_P2_#t~mem25_66| v_~__unbuffered_p2_EAX~0_86) .cse5) (and (= (ite .cse6 v_~y$w_buff0~0_430 v_~y$w_buff1~0_426) v_~__unbuffered_p2_EAX~0_86) .cse7 (or .cse8 .cse9) (or .cse8 (not .cse3)) (= |v_P2Thread1of1ForFork0_#t~mem25_34| |v_P2_#t~mem25_66|))) (= v_~y$w_buff1_used~0_630 (ite .cse0 .cse10 (ite (or .cse11 .cse12 .cse4) .cse10 0))) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~y$w_buff1~0_426 v_~y$w_buff1~0_425) (= v_~y$r_buff0_thd0~0_221 (ite .cse13 0 v_~y$r_buff0_thd0~0_222)) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~mem39#1_167|))) (or (and .cse14 (= |v_ULTIMATE.start_main_#t~ite40#1_166| |v_ULTIMATE.start_main_#t~ite40#1_164|) .cse15 .cse16 (= v_~y$mem_tmp~0_196 v_~y$w_buff0~0_430)) (and (= v_~y$mem_tmp~0_196 |v_ULTIMATE.start_main_#t~ite40#1_164|) (or .cse17 .cse18) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_167| |v_ULTIMATE.start_main_#t~ite40#1_164|) (or .cse19 .cse20) (= |v_ULTIMATE.start_main_#t~mem39#1_167| 1)) (and (= v_~y$w_buff1~0_426 |v_ULTIMATE.start_main_#t~ite40#1_164|) .cse21 .cse14 .cse22))))) (= (store |v_#memory_int_826| |v_~#y~0.base_408| (store (select |v_#memory_int_826| |v_~#y~0.base_408|) |v_~#y~0.offset_408| |v_P2_#t~ite29_51|)) |v_#memory_int_824|) (= (ite .cse0 v_~y$r_buff0_thd3~0_194 (ite (or .cse11 (and .cse23 .cse2) .cse4) v_~y$r_buff0_thd3~0_194 (ite (and .cse8 (not .cse4)) 0 v_~y$r_buff0_thd3~0_194))) v_~y$r_buff0_thd3~0_193) (= (ite .cse0 .cse24 (ite .cse5 .cse24 (ite .cse6 0 .cse24))) v_~y$w_buff0_used~0_650) (= v_~y$w_buff0~0_429 v_~y$w_buff0~0_430) (= v_~y$r_buff1_thd0~0_220 (ite (or (and .cse21 .cse9) (and .cse7 (not (= (mod v_~y$r_buff0_thd0~0_221 256) 0)))) 0 v_~y$r_buff1_thd0~0_221)) (= v_~weak$$choice2~0_244 |v_P2Thread1of1ForFork0_#t~nondet23_34|) (or (and (= |v_P2Thread1of1ForFork0_#t~mem28_34| |v_P2_#t~mem28_50|) .cse0 (= |v_P2_#t~ite29_51| v_~y$mem_tmp~0_196)) (and (= |v_P2_#t~ite29_51| |v_P2_#t~mem28_50|) .cse25 (= |v_P2_#t~mem28_50| v_~__unbuffered_p2_EAX~0_86))) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_408|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_34|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_652, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_34|, ~#y~0.base=|v_~#y~0.base_408|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_34|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_177, ~y$w_buff1~0=v_~y$w_buff1~0_426, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_194, ~y$w_buff0~0=v_~y$w_buff0~0_430, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #memory_int=|v_#memory_int_826|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_34|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_169|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_166|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_632} OutVars{~#y~0.offset=|v_~#y~0.offset_408|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ~#y~0.base=|v_~#y~0.base_408|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_196, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_133|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_176, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_193, ~y$w_buff0~0=v_~y$w_buff0~0_429, ~y$flush_delayed~0=v_~y$flush_delayed~0_224, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_19|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~weak$$choice0~0=v_~weak$$choice0~0_219, ~y$w_buff1~0=v_~y$w_buff1~0_425, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_221, #memory_int=|v_#memory_int_824|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_19|, ~weak$$choice2~0=v_~weak$$choice2~0_244, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_630} AuxVars[|v_P2_#t~mem28_50|, |v_ULTIMATE.start_main_#t~ite40#1_164|, |v_P2_#t~ite29_51|, |v_P2_#t~mem25_66|, |v_ULTIMATE.start_main_#t~mem39#1_167|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~ite41#1, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite29, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:59:08,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] L856-3-->L861: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~main$tmp_guard0~0_36 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_81) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_23|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [864] L791-->L801: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_214 256) 0)) (.cse13 (= (mod v_~y$w_buff0_used~0_640 256) 0))) (let ((.cse19 (not .cse13)) (.cse20 (not .cse14))) (let ((.cse22 (ite (and .cse19 .cse20) 0 v_~y$w_buff0_used~0_640))) (let ((.cse3 (= (mod .cse22 256) 0))) (let ((.cse15 (= (mod v_~y$r_buff1_thd0~0_213 256) 0)) (.cse16 (= (mod v_~y$w_buff1_used~0_620 256) 0)) (.cse0 (not .cse3))) (let ((.cse9 (and .cse0 .cse20)) (.cse18 (not .cse16)) (.cse10 (not .cse15))) (let ((.cse12 (ite (or .cse9 (and .cse18 .cse10)) 0 v_~y$w_buff1_used~0_620)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_102 256) 0))) (let ((.cse1 (not .cse4)) (.cse21 (not (= (mod v_~y$w_buff0_used~0_638 256) 0))) (.cse6 (= (mod v_~y$r_buff1_thd2~0_92 256) 0)) (.cse5 (= (mod .cse12 256) 0))) (let ((.cse8 (not .cse5)) (.cse7 (not .cse6)) (.cse11 (and .cse1 .cse21))) (and (let ((.cse2 (= |v_P1Thread1of1ForFork2_#t~mem19_50| |v_P1_#t~mem19_58|))) (or (and .cse0 (= |v_P1_#t~ite20_55| |v_P1Thread1of1ForFork2_#t~ite20_50|) (= |v_P1_#t~ite21_50| v_~y$w_buff0~0_423) .cse1 .cse2) (and (or .cse3 .cse4) (or (and (or .cse5 .cse6) (= |v_P1_#t~ite20_55| |v_P1_#t~mem19_58|) (= |v_ULTIMATE.start_main_#t~ite41#1_126| |v_P1_#t~mem19_58|)) (and (= v_~y$w_buff1~0_419 |v_P1_#t~ite20_55|) .cse7 .cse2 .cse8)) (= |v_P1_#t~ite20_55| |v_P1_#t~ite21_50|)))) (= v_~y$r_buff0_thd0~0_213 (ite .cse9 0 v_~y$r_buff0_thd0~0_214)) (= v_~y$r_buff1_thd0~0_212 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_213 256) 0)) .cse0) (and .cse10 .cse8)) 0 v_~y$r_buff1_thd0~0_213)) (= v_~y$w_buff1_used~0_618 (ite (or .cse11 (and .cse7 .cse8)) 0 .cse12)) (let ((.cse17 (= |v_ULTIMATE.start_main_#t~mem39#1_157| |v_ULTIMATE.start_main_#t~mem39#1_155|))) (or (and (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite41#1_126| |v_ULTIMATE.start_main_#t~ite40#1_152|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_155| |v_ULTIMATE.start_main_#t~ite40#1_152|) (= |v_ULTIMATE.start_main_#t~mem39#1_155| 1) (or .cse15 .cse16)) (and .cse17 (= v_~y$w_buff1~0_419 |v_ULTIMATE.start_main_#t~ite40#1_152|) .cse18 .cse10))) (and .cse17 .cse19 (= |v_ULTIMATE.start_main_#t~ite41#1_126| v_~y$w_buff0~0_423) (= |v_ULTIMATE.start_main_#t~ite40#1_154| |v_ULTIMATE.start_main_#t~ite40#1_152|) .cse20))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_101 256) 0)) .cse21) (and (not (= (mod v_~y$w_buff1_used~0_618 256) 0)) .cse7)) 0 v_~y$r_buff1_thd2~0_92) v_~y$r_buff1_thd2~0_91) (= (store |v_#memory_int_814| |v_~#y~0.base_404| (store (select |v_#memory_int_814| |v_~#y~0.base_404|) |v_~#y~0.offset_404| |v_P1_#t~ite21_50|)) |v_#memory_int_812|) (= v_~y$w_buff0_used~0_638 (ite (and .cse0 .cse1) 0 .cse22)) (= v_~y$r_buff0_thd2~0_101 (ite .cse11 0 v_~y$r_buff0_thd2~0_102)))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_404|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_640, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_50|, ~#y~0.base=|v_~#y~0.base_404|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_419, ~y$w_buff0~0=v_~y$w_buff0~0_423, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_214, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, #memory_int=|v_#memory_int_814|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_157|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_213, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_154|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620, P1Thread1of1ForFork2_#t~mem19=|v_P1Thread1of1ForFork2_#t~mem19_50|} OutVars{~#y~0.offset=|v_~#y~0.offset_404|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_638, ~#y~0.base=|v_~#y~0.base_404|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_125|, ~y$w_buff1~0=v_~y$w_buff1~0_419, ~y$w_buff0~0=v_~y$w_buff0~0_423, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_213, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, #memory_int=|v_#memory_int_812|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_618} AuxVars[|v_P1_#t~ite20_55|, |v_ULTIMATE.start_main_#t~ite40#1_152|, |v_P1_#t~mem19_58|, |v_P1_#t~ite21_50|, |v_ULTIMATE.start_main_#t~ite41#1_126|, |v_ULTIMATE.start_main_#t~mem39#1_155|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41#1, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~mem39#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite40#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem19] [2022-12-13 11:59:09,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:59:09,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2110 [2022-12-13 11:59:09,612 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 414 flow [2022-12-13 11:59:09,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:09,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:09,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:09,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:59:09,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1394588891, now seen corresponding path program 1 times [2022-12-13 11:59:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956283325] [2022-12-13 11:59:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:09,798 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:59:09,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:09,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956283325] [2022-12-13 11:59:09,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956283325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:09,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:09,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:59:09,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898990744] [2022-12-13 11:59:09,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:09,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:59:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:59:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:59:09,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-13 11:59:09,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:59:09,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:09,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-13 11:59:09,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:10,319 INFO L130 PetriNetUnfolder]: 1715/3025 cut-off events. [2022-12-13 11:59:10,319 INFO L131 PetriNetUnfolder]: For 9473/9608 co-relation queries the response was YES. [2022-12-13 11:59:10,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12853 conditions, 3025 events. 1715/3025 cut-off events. For 9473/9608 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 19758 event pairs, 91 based on Foata normal form. 228/2332 useless extension candidates. Maximal degree in co-relation 12828. Up to 2242 conditions per place. [2022-12-13 11:59:10,331 INFO L137 encePairwiseOnDemand]: 24/37 looper letters, 67 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2022-12-13 11:59:10,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 843 flow [2022-12-13 11:59:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:59:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:59:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 11:59:10,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2022-12-13 11:59:10,333 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 414 flow. Second operand 4 states and 95 transitions. [2022-12-13 11:59:10,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 843 flow [2022-12-13 11:59:10,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 819 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 11:59:10,337 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 470 flow [2022-12-13 11:59:10,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-13 11:59:10,337 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2022-12-13 11:59:10,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:10,338 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 470 flow [2022-12-13 11:59:10,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:10,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:10,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 470 flow [2022-12-13 11:59:10,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 63 transitions, 470 flow [2022-12-13 11:59:10,476 INFO L130 PetriNetUnfolder]: 671/1555 cut-off events. [2022-12-13 11:59:10,476 INFO L131 PetriNetUnfolder]: For 2442/2819 co-relation queries the response was YES. [2022-12-13 11:59:10,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 1555 events. 671/1555 cut-off events. For 2442/2819 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 12122 event pairs, 72 based on Foata normal form. 17/995 useless extension candidates. Maximal degree in co-relation 5766. Up to 937 conditions per place. [2022-12-13 11:59:10,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 63 transitions, 470 flow [2022-12-13 11:59:10,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-13 11:59:10,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:59:10,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-13 11:59:10,806 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 474 flow [2022-12-13 11:59:10,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:59:10,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:10,806 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:59:10,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:59:10,806 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1503595807, now seen corresponding path program 1 times [2022-12-13 11:59:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:10,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961042194] [2022-12-13 11:59:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:10,997 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:59:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:10,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961042194] [2022-12-13 11:59:10,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961042194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:10,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:10,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:59:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119311999] [2022-12-13 11:59:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:11,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:59:11,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:59:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:59:11,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-13 11:59:11,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:59:11,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:11,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-13 11:59:11,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:11,321 INFO L130 PetriNetUnfolder]: 968/1774 cut-off events. [2022-12-13 11:59:11,321 INFO L131 PetriNetUnfolder]: For 5291/5363 co-relation queries the response was YES. [2022-12-13 11:59:11,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8748 conditions, 1774 events. 968/1774 cut-off events. For 5291/5363 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11025 event pairs, 10 based on Foata normal form. 267/1408 useless extension candidates. Maximal degree in co-relation 8721. Up to 976 conditions per place. [2022-12-13 11:59:11,327 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 50 selfloop transitions, 28 changer transitions 9/91 dead transitions. [2022-12-13 11:59:11,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 887 flow [2022-12-13 11:59:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:59:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:59:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 11:59:11,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-13 11:59:11,330 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 474 flow. Second operand 5 states and 99 transitions. [2022-12-13 11:59:11,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 887 flow [2022-12-13 11:59:11,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 789 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 11:59:11,337 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 422 flow [2022-12-13 11:59:11,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-13 11:59:11,338 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2022-12-13 11:59:11,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:11,338 INFO L89 Accepts]: Start accepts. Operand has 60 places, 56 transitions, 422 flow [2022-12-13 11:59:11,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:11,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:11,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions, 422 flow [2022-12-13 11:59:11,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 56 transitions, 422 flow [2022-12-13 11:59:11,368 INFO L130 PetriNetUnfolder]: 125/352 cut-off events. [2022-12-13 11:59:11,368 INFO L131 PetriNetUnfolder]: For 215/344 co-relation queries the response was YES. [2022-12-13 11:59:11,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 352 events. 125/352 cut-off events. For 215/344 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1918 event pairs, 0 based on Foata normal form. 3/187 useless extension candidates. Maximal degree in co-relation 1198. Up to 235 conditions per place. [2022-12-13 11:59:11,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 56 transitions, 422 flow [2022-12-13 11:59:11,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 11:59:13,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [873] $Ultimate##0-->L779: Formula: (let ((.cse24 (mod v_~y$w_buff0_used~0_681 256)) (.cse25 (mod v_~weak$$choice0~0_223 256)) (.cse2 (= (mod v_~y$w_buff0_used~0_680 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd1~0_238 256) 0))) (let ((.cse19 (not .cse5)) (.cse6 (not .cse2)) (.cse26 (= (mod v_~weak$$choice2~0_248 256) 0)) (.cse20 (= .cse25 0)) (.cse22 (= (mod v_~y$w_buff1_used~0_661 256) 0)) (.cse14 (= .cse24 0)) (.cse11 (select |v_#memory_int_861| |v_~#y~0.base_422|))) (let ((.cse0 (select .cse11 |v_~#y~0.offset_422|)) (.cse23 (not .cse14)) (.cse4 (not .cse22)) (.cse10 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_180 256) 0)) (.cse1 (not .cse26)) (.cse3 (and .cse19 .cse6)) (.cse9 (not (= (mod v_~y$w_buff1_used~0_660 256) 0))) (.cse7 (= (mod v_~y$r_buff1_thd1~0_228 256) 0))) (and (= |v_P0Thread1of1ForFork1_#in~arg.base_75| v_P0Thread1of1ForFork1_~arg.base_75) (= v_~y$mem_tmp~0_200 .cse0) (= v_~y$w_buff1~0_444 v_~y$w_buff1~0_443) (= v_~weak$$choice2~0_248 |v_P0Thread1of1ForFork1_#t~nondet4_150|) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147 |v_~#y~0.base_422|) (= v_~y$flush_delayed~0_228 0) (= v_~y$w_buff1_used~0_660 (ite .cse1 v_~y$w_buff1_used~0_661 (ite .cse2 v_~y$w_buff1_used~0_661 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse7) v_~weak$$choice0~0_223 0))))) (= v_~y$r_buff1_thd1~0_227 (ite .cse1 v_~y$r_buff1_thd1~0_228 (ite .cse2 v_~y$r_buff1_thd1~0_228 (let ((.cse8 (= (mod v_~y$r_buff0_thd1~0_237 256) 0))) (ite (and (not .cse8) .cse6) 0 (ite (and .cse6 .cse9 .cse8 .cse7) (ite .cse10 v_~y$r_buff1_thd1~0_228 0) 0)))))) (= |v_#memory_int_860| (store |v_#memory_int_861| |v_~#y~0.base_422| (store .cse11 |v_~#y~0.offset_422| |v_P0_#t~ite18_115|))) (= v_P0Thread1of1ForFork1_~arg.offset_75 |v_P0Thread1of1ForFork1_#in~arg.offset_75|) (= v_~__unbuffered_p0_EAX$read_delayed~0_166 1) (let ((.cse13 (= |v_P0Thread1of1ForFork1_#t~ite13_150| |v_P0_#t~ite13_145|)) (.cse17 (= |v_P0Thread1of1ForFork1_#t~ite12_150| |v_P0_#t~ite12_149|)) (.cse12 (= |v_P0Thread1of1ForFork1_#t~mem8_150| |v_P0_#t~mem8_156|)) (.cse15 (= |v_P0_#t~ite9_153| |v_P0Thread1of1ForFork1_#t~ite9_150|)) (.cse18 (= |v_P0Thread1of1ForFork1_#t~ite11_150| |v_P0_#t~ite11_157|)) (.cse16 (= |v_P0_#t~mem10_160| |v_P0Thread1of1ForFork1_#t~mem10_150|))) (or (and .cse12 (= v_~__unbuffered_p0_EAX~0_192 |v_P0_#t~mem7_134|) (= .cse0 |v_P0_#t~mem7_134|) .cse13 (= |v_P0Thread1of1ForFork1_#t~ite14_150| |v_P0_#t~ite14_141|) .cse14 .cse15 .cse16 .cse17 .cse18) (and (or (and .cse12 .cse13 (= |v_P0_#t~ite14_141| v_~y$w_buff0~0_448) .cse19 .cse15 .cse16 .cse17 .cse18) (and (or (and (= |v_P0_#t~ite13_145| |v_P0_#t~ite9_153|) .cse4 (or (and .cse20 .cse12 (= |v_P0_#t~ite9_153| (ite (not .cse21) v_~y$w_buff0~0_448 v_~y$w_buff1~0_444))) (and .cse10 (= |v_P0_#t~ite9_153| |v_P0_#t~mem8_156|) (= .cse0 |v_P0_#t~mem8_156|))) .cse16 .cse17 .cse18 .cse7) (and .cse12 .cse15 (= |v_P0_#t~ite12_149| |v_P0_#t~ite13_145|) (or (and .cse4 (= |v_P0_#t~ite12_149| (ite .cse10 v_~y$w_buff1~0_444 v_~y$w_buff0~0_448)) .cse16 .cse18) (and (or (and (= |v_P0_#t~ite11_157| v_~y$w_buff0~0_448) .cse10 .cse16) (and .cse20 (= |v_P0_#t~mem10_160| .cse0) (= |v_P0_#t~mem10_160| |v_P0_#t~ite11_157|))) .cse22 (= |v_P0_#t~ite11_157| |v_P0_#t~ite12_149|))) (or .cse22 (not .cse7)))) .cse5 (= |v_P0_#t~ite13_145| |v_P0_#t~ite14_141|))) .cse23 (= |v_P0_#t~ite14_141| v_~__unbuffered_p0_EAX~0_192) (= |v_P0Thread1of1ForFork1_#t~mem7_150| |v_P0_#t~mem7_134|)))) (= v_~weak$$choice1~0_180 |v_P0Thread1of1ForFork1_#t~nondet6_150|) (= |v_~#y~0.offset_422| v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147) (= v_~y$w_buff0~0_447 v_~y$w_buff0~0_448) (= (ite (= (ite .cse1 .cse24 (ite .cse14 .cse24 (ite (and .cse23 .cse19) 0 (ite (and .cse23 .cse4 .cse5 .cse7) (ite (or .cse10 .cse21) 1 0) .cse25)))) 0) 0 1) v_~y$w_buff0_used~0_680) (or (and .cse26 (= |v_P0_#t~mem17_112| v_~__unbuffered_p0_EAX~0_192) (= |v_P0_#t~mem17_112| |v_P0_#t~ite18_115|)) (and (= |v_P0_#t~mem17_112| |v_P0Thread1of1ForFork1_#t~mem17_150|) (= |v_P0_#t~ite18_115| v_~y$mem_tmp~0_200) .cse1)) (= v_~weak$$choice0~0_223 |v_P0Thread1of1ForFork1_#t~nondet3_150|) (= v_~x~0_85 1) (= v_~y$r_buff0_thd1~0_237 (ite .cse1 v_~y$r_buff0_thd1~0_238 (ite .cse2 v_~y$r_buff0_thd1~0_238 (ite .cse3 0 (ite (and .cse5 .cse6 .cse9 .cse7) v_~y$r_buff0_thd1~0_238 0))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_422|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_681, P0Thread1of1ForFork1_#t~mem10=|v_P0Thread1of1ForFork1_#t~mem10_150|, ~#y~0.base=|v_~#y~0.base_422|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_75|, P0Thread1of1ForFork1_#t~mem7=|v_P0Thread1of1ForFork1_#t~mem7_150|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_150|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_228, P0Thread1of1ForFork1_#t~mem17=|v_P0Thread1of1ForFork1_#t~mem17_150|, ~y$w_buff1~0=v_~y$w_buff1~0_444, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_75|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_150|, ~y$w_buff0~0=v_~y$w_buff0~0_448, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_238, #memory_int=|v_#memory_int_861|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_150|, P0Thread1of1ForFork1_#t~ite14=|v_P0Thread1of1ForFork1_#t~ite14_150|, P0Thread1of1ForFork1_#t~ite13=|v_P0Thread1of1ForFork1_#t~ite13_150|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_150|, P0Thread1of1ForFork1_#t~ite12=|v_P0Thread1of1ForFork1_#t~ite12_150|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_661, P0Thread1of1ForFork1_#t~ite11=|v_P0Thread1of1ForFork1_#t~ite11_150|, P0Thread1of1ForFork1_#t~nondet6=|v_P0Thread1of1ForFork1_#t~nondet6_150|} OutVars{~#y~0.offset=|v_~#y~0.offset_422|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_680, ~#y~0.base=|v_~#y~0.base_422|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_77|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_75, P0Thread1of1ForFork1_#t~mem16=|v_P0Thread1of1ForFork1_#t~mem16_77|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_227, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_192, ~weak$$choice1~0=v_~weak$$choice1~0_180, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_75|, ~y$w_buff0~0=v_~y$w_buff0~0_447, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_237, P0Thread1of1ForFork1_#t~ite18=|v_P0Thread1of1ForFork1_#t~ite18_77|, ~y$flush_delayed~0=v_~y$flush_delayed~0_228, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_75, P0Thread1of1ForFork1_#t~ite15=|v_P0Thread1of1ForFork1_#t~ite15_77|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_166, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_75|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147, ~weak$$choice0~0=v_~weak$$choice0~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_443, #memory_int=|v_#memory_int_860|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~x~0=v_~x~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_660} AuxVars[|v_P0_#t~ite14_141|, |v_P0_#t~mem10_160|, |v_P0_#t~mem8_156|, |v_P0_#t~ite11_157|, |v_P0_#t~ite12_149|, |v_P0_#t~mem7_134|, |v_P0_#t~ite18_115|, |v_P0_#t~ite13_145|, |v_P0_#t~ite9_153|, |v_P0_#t~mem17_112|] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem10, P0Thread1of1ForFork1_#t~mem7, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem16, ~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem17, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite18, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~ite15, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork1_#t~ite14, P0Thread1of1ForFork1_#t~ite13, P0Thread1of1ForFork1_#t~ite12, P0Thread1of1ForFork1_#t~ite11, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite9, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0, P0Thread1of1ForFork1_#t~nondet6] and [794] $Ultimate##0-->L791: Formula: (and (= v_~x~0_36 2) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] [2022-12-13 11:59:19,468 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:59:19,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8131 [2022-12-13 11:59:19,469 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 422 flow [2022-12-13 11:59:19,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:59:19,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:19,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:19,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:59:19,469 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -911003643, now seen corresponding path program 1 times [2022-12-13 11:59:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:19,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909453188] [2022-12-13 11:59:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:59:19,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:59:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:59:19,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:59:19,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:59:19,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 11:59:19,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 11:59:19,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 11:59:19,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 11:59:19,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:59:19,656 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:19,659 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:59:19,659 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:59:19,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:59:19 BasicIcfg [2022-12-13 11:59:19,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:59:19,721 INFO L158 Benchmark]: Toolchain (without parser) took 44962.20ms. Allocated memory was 177.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 151.7MB in the beginning and 1.0GB in the end (delta: -860.1MB). Peak memory consumption was 155.5MB. Max. memory is 8.0GB. [2022-12-13 11:59:19,721 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:59:19,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.80ms. Allocated memory is still 177.2MB. Free memory was 151.2MB in the beginning and 121.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 11:59:19,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.56ms. Allocated memory is still 177.2MB. Free memory was 121.3MB in the beginning and 118.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:59:19,722 INFO L158 Benchmark]: Boogie Preprocessor took 33.98ms. Allocated memory is still 177.2MB. Free memory was 118.7MB in the beginning and 116.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:59:19,722 INFO L158 Benchmark]: RCFGBuilder took 994.47ms. Allocated memory was 177.2MB in the beginning and 243.3MB in the end (delta: 66.1MB). Free memory was 116.1MB in the beginning and 181.2MB in the end (delta: -65.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2022-12-13 11:59:19,722 INFO L158 Benchmark]: TraceAbstraction took 43425.18ms. Allocated memory was 243.3MB in the beginning and 1.2GB in the end (delta: 949.0MB). Free memory was 180.2MB in the beginning and 1.0GB in the end (delta: -831.6MB). Peak memory consumption was 117.3MB. Max. memory is 8.0GB. [2022-12-13 11:59:19,723 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 455.80ms. Allocated memory is still 177.2MB. Free memory was 151.2MB in the beginning and 121.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.56ms. Allocated memory is still 177.2MB. Free memory was 121.3MB in the beginning and 118.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.98ms. Allocated memory is still 177.2MB. Free memory was 118.7MB in the beginning and 116.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 994.47ms. Allocated memory was 177.2MB in the beginning and 243.3MB in the end (delta: 66.1MB). Free memory was 116.1MB in the beginning and 181.2MB in the end (delta: -65.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. * TraceAbstraction took 43425.18ms. Allocated memory was 243.3MB in the beginning and 1.2GB in the end (delta: 949.0MB). Free memory was 180.2MB in the beginning and 1.0GB in the end (delta: -831.6MB). Peak memory consumption was 117.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 118 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1530, independent: 1430, independent conditional: 1430, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1530, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1530, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1530, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 969, independent: 924, independent conditional: 0, independent unconditional: 924, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 969, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 311, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1530, independent: 506, independent conditional: 0, independent unconditional: 506, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 969, unknown conditional: 0, unknown unconditional: 969] , Statistics on independence cache: Total cache size (in pairs): 1406, Positive cache size: 1361, Positive conditional cache size: 0, Positive unconditional cache size: 1361, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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.3s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 308, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 297, dependent conditional: 0, dependent unconditional: 297, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 121, unknown conditional: 0, unknown unconditional: 121] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98, independent: 75, independent conditional: 7, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98, independent: 76, independent conditional: 7, independent unconditional: 69, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 98, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 79, independent conditional: 14, independent unconditional: 65, dependent: 21, dependent conditional: 14, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 79, independent conditional: 7, independent unconditional: 72, dependent: 21, dependent conditional: 14, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 79, independent conditional: 7, independent unconditional: 72, dependent: 21, dependent conditional: 14, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 224, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 224, dependent conditional: 224, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 76, independent conditional: 7, independent unconditional: 69, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, 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.0s, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 51 PlacesBefore, 50 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 76, independent conditional: 76, 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: 82, independent: 76, independent conditional: 64, independent unconditional: 12, 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: 82, independent: 76, independent conditional: 58, independent unconditional: 18, 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: 82, independent: 76, independent conditional: 58, independent unconditional: 18, 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: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 69, independent conditional: 51, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 118, Positive conditional cache size: 7, Positive unconditional cache size: 111, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 118, Positive conditional cache size: 7, Positive unconditional cache size: 111, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 58 PlacesBefore, 58 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 66, independent conditional: 66, 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: 72, independent: 66, independent conditional: 52, independent unconditional: 14, 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: 72, independent: 66, independent conditional: 44, independent unconditional: 22, 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: 72, independent: 66, independent conditional: 44, independent unconditional: 22, 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: 7, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 60, independent conditional: 40, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 138, Positive conditional cache size: 11, Positive unconditional cache size: 127, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 54 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 86, independent conditional: 57, independent unconditional: 29, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 86, independent conditional: 37, independent unconditional: 49, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 86, independent conditional: 37, independent unconditional: 49, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 11, independent unconditional: 6, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 96, independent: 69, independent conditional: 26, independent unconditional: 43, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 162, Positive conditional cache size: 22, Positive unconditional cache size: 140, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 39, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 164, Positive conditional cache size: 22, Positive unconditional cache size: 142, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 57 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 22, independent unconditional: 14, 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: 36, independent: 36, independent conditional: 16, independent unconditional: 20, 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: 36, independent: 36, independent conditional: 16, independent unconditional: 20, 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: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 36, independent: 25, independent conditional: 9, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 177, Positive conditional cache size: 29, Positive unconditional cache size: 148, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 60 PlacesBefore, 60 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 6, independent unconditional: 6, 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: 12, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 178, Positive conditional cache size: 29, Positive unconditional cache size: 149, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 59 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 53 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 2, independent unconditional: 16, 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: 18, independent: 18, independent conditional: 2, independent unconditional: 16, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 18, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 205, Positive conditional cache size: 29, Positive unconditional cache size: 176, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1801; [L852] FCALL, FORK 0 pthread_create(&t1801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1801, ((void *)0), P0, ((void *)0))=-3, t1801={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 [L778] 1 x = 1 [L790] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={49:50}, arg={0:0}, arg={49:50}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t1802; [L854] FCALL, FORK 0 pthread_create(&t1802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1802, ((void *)0), P1, ((void *)0))=-2, t1801={7:0}, t1802={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t1803; [L856] FCALL, FORK 0 pthread_create(&t1803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1803, ((void *)0), P2, ((void *)0))=-1, t1801={7:0}, t1802={5:0}, t1803={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 y = 1 [L810] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 2 y$flush_delayed = weak$$choice2 [L813] EXPR 2 \read(y) [L813] 2 y$mem_tmp = y [L814] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] EXPR 2 \read(y) [L814] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 2 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 2 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 2 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 2 \read(y) [L821] 2 __unbuffered_p2_EAX = y [L822] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L822] 2 y = y$flush_delayed ? y$mem_tmp : y [L823] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=53, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=53, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 3 y = 2 [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 \read(y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=53, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=53, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 \read(y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L870] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L871] 0 y$flush_delayed = weak$$choice2 [L872] EXPR 0 \read(y) [L872] 0 y$mem_tmp = y [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] EXPR 0 \read(y) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L875] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L876] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L877] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L879] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 x == 2 && y == 2 [L882] EXPR 0 \read(y) [L882] EXPR 0 x == 2 && y == 2 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] EXPR 0 \read(y) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 872 IncrementalHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 5 mSDtfsCounter, 872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=12, InterpolantAutomatonStates: 51, 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.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1365 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:59:19,753 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...