/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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:33:51,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:33:51,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:33:51,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:33:51,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:33:51,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:33:51,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:33:51,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:33:51,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:33:51,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:33:51,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:33:51,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:33:51,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:33:51,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:33:51,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:33:51,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:33:51,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:33:51,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:33:51,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:33:51,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:33:51,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:33:51,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:33:51,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:33:51,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:33:51,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:33:51,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:33:51,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:33:51,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:33:51,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:33:51,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:33:51,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:33:51,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:33:51,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:33:51,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:33:51,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:33:51,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:33:51,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:33:51,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:33:51,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:33:51,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:33:51,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:33:51,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:33:51,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:33:51,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:33:51,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:33:51,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:33:51,155 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:33:51,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:33:51,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:33:51,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:33:51,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:33:51,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:33:51,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:33:51,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:33:51,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:33:51,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:33:51,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:33:51,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:33:51,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:33:51,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:33:51,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:33:51,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:33:51,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:33:51,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:33:51,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:33:51,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:33:51,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:33:51,461 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:33:51,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 06:33:52,576 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:33:52,810 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:33:52,810 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 06:33:52,833 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3f4248c/9268cdb37897488cad81f84fdddd8851/FLAG99a86a489 [2022-12-06 06:33:52,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3f4248c/9268cdb37897488cad81f84fdddd8851 [2022-12-06 06:33:52,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:33:52,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:33:52,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:33:52,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:33:52,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:33:52,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:33:52" (1/1) ... [2022-12-06 06:33:52,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365ff7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:52, skipping insertion in model container [2022-12-06 06:33:52,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:33:52" (1/1) ... [2022-12-06 06:33:52,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:33:52,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:33:53,017 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-12-06 06:33:53,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:33:53,226 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:33:53,237 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-12-06 06:33:53,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:33:53,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:33:53,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:33:53,340 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:33:53,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53 WrapperNode [2022-12-06 06:33:53,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:33:53,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:33:53,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:33:53,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:33:53,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,397 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 06:33:53,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:33:53,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:33:53,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:33:53,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:33:53,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,427 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:33:53,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:33:53,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:33:53,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:33:53,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (1/1) ... [2022-12-06 06:33:53,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:33:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:33:53,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:33:53,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:33:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:33:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:33:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:33:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:33:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:33:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:33:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:33:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:33:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:33:53,538 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:33:53,628 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:33:53,629 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:33:53,913 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:33:54,028 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:33:54,028 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:33:54,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:33:54 BoogieIcfgContainer [2022-12-06 06:33:54,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:33:54,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:33:54,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:33:54,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:33:54,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:33:52" (1/3) ... [2022-12-06 06:33:54,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cfae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:33:54, skipping insertion in model container [2022-12-06 06:33:54,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:33:53" (2/3) ... [2022-12-06 06:33:54,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cfae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:33:54, skipping insertion in model container [2022-12-06 06:33:54,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:33:54" (3/3) ... [2022-12-06 06:33:54,036 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 06:33:54,053 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:33:54,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:33:54,053 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:33:54,124 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:33:54,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:33:54,210 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:33:54,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:54,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:33:54,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:33:54,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 06:33:54,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:33:54,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:33:54,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 06:33:54,287 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:33:54,288 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:54,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:33:54,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:33:54,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 1800 [2022-12-06 06:33:58,138 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-06 06:33:58,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:33:58,155 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;@6d546747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:33:58,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:33:58,158 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:33:58,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:58,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:33:58,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:33:58,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:33:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:33:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 466739718, now seen corresponding path program 1 times [2022-12-06 06:33:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:33:58,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709770589] [2022-12-06 06:33:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:33:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:33:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:33:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:33:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:33:58,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709770589] [2022-12-06 06:33:58,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709770589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:33:58,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:33:58,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:33:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760284719] [2022-12-06 06:33:58,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:33:58,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:33:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:33:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:33:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:33:58,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:33:58,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:58,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:33:58,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:33:58,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:33:58,879 INFO L130 PetriNetUnfolder]: 1124/1781 cut-off events. [2022-12-06 06:33:58,880 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 06:33:58,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1781 events. 1124/1781 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8728 event pairs, 144 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 3498. Up to 1413 conditions per place. [2022-12-06 06:33:58,904 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 28 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-06 06:33:58,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 158 flow [2022-12-06 06:33:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:33:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:33:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 06:33:58,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 06:33:58,919 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 44 transitions. [2022-12-06 06:33:58,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 158 flow [2022-12-06 06:33:58,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:33:58,926 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-06 06:33:58,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 06:33:58,934 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:33:58,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:33:58,935 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-06 06:33:58,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:33:58,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:33:58,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-06 06:33:58,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:33:58,988 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:33:58,989 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:33:58,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:33:58,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 06:33:59,150 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:33:59,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 06:33:59,152 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:33:59,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:59,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:33:59,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:33:59,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:33:59,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:33:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:33:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1003430744, now seen corresponding path program 1 times [2022-12-06 06:33:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:33:59,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086987247] [2022-12-06 06:33:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:33:59,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:33:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:33:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:33:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:33:59,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086987247] [2022-12-06 06:33:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086987247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:33:59,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:33:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:33:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807552799] [2022-12-06 06:33:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:33:59,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:33:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:33:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:33:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:33:59,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:33:59,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:59,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:33:59,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:33:59,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:33:59,478 INFO L130 PetriNetUnfolder]: 645/1038 cut-off events. [2022-12-06 06:33:59,478 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 06:33:59,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1038 events. 645/1038 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4439 event pairs, 219 based on Foata normal form. 32/1070 useless extension candidates. Maximal degree in co-relation 2120. Up to 675 conditions per place. [2022-12-06 06:33:59,482 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 06:33:59,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 130 flow [2022-12-06 06:33:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:33:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:33:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:33:59,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:33:59,484 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:33:59,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 130 flow [2022-12-06 06:33:59,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:33:59,487 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 06:33:59,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 06:33:59,487 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-06 06:33:59,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:33:59,487 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 06:33:59,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:33:59,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:33:59,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 06:33:59,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 06:33:59,492 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:33:59,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:59,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:33:59,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 06:33:59,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 06:33:59,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:33:59,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:33:59,512 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 06:33:59,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:59,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:33:59,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:33:59,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:33:59,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:33:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:33:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash -242445089, now seen corresponding path program 1 times [2022-12-06 06:33:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:33:59,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814482792] [2022-12-06 06:33:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:33:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:33:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:33:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:33:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:33:59,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814482792] [2022-12-06 06:33:59,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814482792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:33:59,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:33:59,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:33:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313269806] [2022-12-06 06:33:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:33:59,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:33:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:33:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:33:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:33:59,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:33:59,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:59,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:33:59,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:33:59,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:33:59,849 INFO L130 PetriNetUnfolder]: 616/943 cut-off events. [2022-12-06 06:33:59,849 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-06 06:33:59,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 943 events. 616/943 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4166 event pairs, 106 based on Foata normal form. 12/954 useless extension candidates. Maximal degree in co-relation 2076. Up to 787 conditions per place. [2022-12-06 06:33:59,857 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 30 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 06:33:59,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 151 flow [2022-12-06 06:33:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:33:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:33:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:33:59,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:33:59,858 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:33:59,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 151 flow [2022-12-06 06:33:59,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:33:59,859 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2022-12-06 06:33:59,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 06:33:59,860 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 06:33:59,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:33:59,860 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 58 flow [2022-12-06 06:33:59,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:33:59,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:33:59,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2022-12-06 06:33:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2022-12-06 06:33:59,865 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:33:59,865 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:33:59,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:33:59,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2022-12-06 06:33:59,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 06:33:59,866 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:33:59,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 06:33:59,868 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2022-12-06 06:33:59,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:33:59,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:33:59,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:33:59,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:33:59,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:33:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:33:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 586477952, now seen corresponding path program 1 times [2022-12-06 06:33:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:33:59,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998958921] [2022-12-06 06:33:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:33:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:33:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:00,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998958921] [2022-12-06 06:34:00,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998958921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:00,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:00,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167277530] [2022-12-06 06:34:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:00,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:34:00,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:00,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:00,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:34:00,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:00,317 INFO L130 PetriNetUnfolder]: 923/1390 cut-off events. [2022-12-06 06:34:00,317 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-12-06 06:34:00,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 1390 events. 923/1390 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5653 event pairs, 68 based on Foata normal form. 16/1406 useless extension candidates. Maximal degree in co-relation 3173. Up to 853 conditions per place. [2022-12-06 06:34:00,326 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 45 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2022-12-06 06:34:00,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 262 flow [2022-12-06 06:34:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:34:00,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 06:34:00,328 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:34:00,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 262 flow [2022-12-06 06:34:00,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:00,330 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 134 flow [2022-12-06 06:34:00,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 06:34:00,331 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 06:34:00,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:00,331 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 134 flow [2022-12-06 06:34:00,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:00,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:00,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 134 flow [2022-12-06 06:34:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 134 flow [2022-12-06 06:34:00,343 INFO L130 PetriNetUnfolder]: 27/89 cut-off events. [2022-12-06 06:34:00,344 INFO L131 PetriNetUnfolder]: For 52/108 co-relation queries the response was YES. [2022-12-06 06:34:00,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 89 events. 27/89 cut-off events. For 52/108 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 368 event pairs, 8 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 234. Up to 41 conditions per place. [2022-12-06 06:34:00,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 134 flow [2022-12-06 06:34:00,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:34:00,396 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:00,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 06:34:00,397 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 134 flow [2022-12-06 06:34:00,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:00,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:00,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:00,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:34:00,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1687154008, now seen corresponding path program 2 times [2022-12-06 06:34:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:00,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055357606] [2022-12-06 06:34:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:00,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055357606] [2022-12-06 06:34:00,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055357606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:00,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:00,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592938218] [2022-12-06 06:34:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:00,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:00,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:00,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:34:00,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 134 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:00,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:00,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:34:00,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:00,729 INFO L130 PetriNetUnfolder]: 1149/1748 cut-off events. [2022-12-06 06:34:00,729 INFO L131 PetriNetUnfolder]: For 1528/1528 co-relation queries the response was YES. [2022-12-06 06:34:00,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1748 events. 1149/1748 cut-off events. For 1528/1528 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7455 event pairs, 183 based on Foata normal form. 48/1796 useless extension candidates. Maximal degree in co-relation 5003. Up to 771 conditions per place. [2022-12-06 06:34:00,737 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 5 changer transitions 12/50 dead transitions. [2022-12-06 06:34:00,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 307 flow [2022-12-06 06:34:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 06:34:00,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 06:34:00,738 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 134 flow. Second operand 4 states and 43 transitions. [2022-12-06 06:34:00,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 307 flow [2022-12-06 06:34:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:00,741 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 122 flow [2022-12-06 06:34:00,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-12-06 06:34:00,741 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 06:34:00,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:00,741 INFO L89 Accepts]: Start accepts. Operand has 40 places, 24 transitions, 122 flow [2022-12-06 06:34:00,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:00,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:00,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 122 flow [2022-12-06 06:34:00,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 122 flow [2022-12-06 06:34:00,747 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-06 06:34:00,748 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 06:34:00,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 43 events. 9/43 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 112 event pairs, 6 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 121. Up to 21 conditions per place. [2022-12-06 06:34:00,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 122 flow [2022-12-06 06:34:00,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:34:00,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] $Ultimate##0-->L820: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~x~0_5 1) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x~0] and [449] $Ultimate##0-->L747: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_39)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_16, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:34:00,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:34:00,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:34:00,797 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 128 flow [2022-12-06 06:34:00,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:00,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:00,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:00,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:34:00,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:00,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1000879666, now seen corresponding path program 1 times [2022-12-06 06:34:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:00,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590145040] [2022-12-06 06:34:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:00,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:00,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590145040] [2022-12-06 06:34:00,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590145040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:00,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929063586] [2022-12-06 06:34:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:00,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:00,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:34:00,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:00,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:00,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:34:00,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:01,011 INFO L130 PetriNetUnfolder]: 263/454 cut-off events. [2022-12-06 06:34:01,011 INFO L131 PetriNetUnfolder]: For 781/797 co-relation queries the response was YES. [2022-12-06 06:34:01,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 454 events. 263/454 cut-off events. For 781/797 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1740 event pairs, 68 based on Foata normal form. 28/468 useless extension candidates. Maximal degree in co-relation 1408. Up to 371 conditions per place. [2022-12-06 06:34:01,014 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 32 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2022-12-06 06:34:01,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 254 flow [2022-12-06 06:34:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:34:01,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:34:01,015 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 128 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:34:01,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 254 flow [2022-12-06 06:34:01,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 216 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 06:34:01,018 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 125 flow [2022-12-06 06:34:01,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-06 06:34:01,018 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 06:34:01,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:01,018 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 125 flow [2022-12-06 06:34:01,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:01,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:01,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 125 flow [2022-12-06 06:34:01,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 125 flow [2022-12-06 06:34:01,031 INFO L130 PetriNetUnfolder]: 37/117 cut-off events. [2022-12-06 06:34:01,031 INFO L131 PetriNetUnfolder]: For 98/150 co-relation queries the response was YES. [2022-12-06 06:34:01,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 117 events. 37/117 cut-off events. For 98/150 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 502 event pairs, 18 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 282. Up to 51 conditions per place. [2022-12-06 06:34:01,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 125 flow [2022-12-06 06:34:01,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:34:01,044 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:01,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:34:01,045 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 125 flow [2022-12-06 06:34:01,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:01,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:01,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:01,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:34:01,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 332865646, now seen corresponding path program 1 times [2022-12-06 06:34:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:01,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247262213] [2022-12-06 06:34:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247262213] [2022-12-06 06:34:01,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247262213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:01,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:01,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:34:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388723095] [2022-12-06 06:34:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:01,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:01,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:34:01,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:01,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:01,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:34:01,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:01,246 INFO L130 PetriNetUnfolder]: 118/235 cut-off events. [2022-12-06 06:34:01,247 INFO L131 PetriNetUnfolder]: For 166/170 co-relation queries the response was YES. [2022-12-06 06:34:01,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 235 events. 118/235 cut-off events. For 166/170 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 809 event pairs, 30 based on Foata normal form. 29/258 useless extension candidates. Maximal degree in co-relation 756. Up to 87 conditions per place. [2022-12-06 06:34:01,248 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 38 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 06:34:01,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 290 flow [2022-12-06 06:34:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:34:01,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:34:01,249 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 125 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:34:01,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 290 flow [2022-12-06 06:34:01,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:01,251 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 161 flow [2022-12-06 06:34:01,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 06:34:01,252 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 06:34:01,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:01,252 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 161 flow [2022-12-06 06:34:01,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:01,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:01,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 161 flow [2022-12-06 06:34:01,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 161 flow [2022-12-06 06:34:01,260 INFO L130 PetriNetUnfolder]: 18/73 cut-off events. [2022-12-06 06:34:01,260 INFO L131 PetriNetUnfolder]: For 68/87 co-relation queries the response was YES. [2022-12-06 06:34:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 73 events. 18/73 cut-off events. For 68/87 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 5 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 207. Up to 31 conditions per place. [2022-12-06 06:34:01,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 161 flow [2022-12-06 06:34:01,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 06:34:01,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:01,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:34:01,262 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 161 flow [2022-12-06 06:34:01,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:01,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:01,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:34:01,263 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1328867004, now seen corresponding path program 1 times [2022-12-06 06:34:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:01,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107869455] [2022-12-06 06:34:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:01,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:01,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107869455] [2022-12-06 06:34:01,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107869455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:01,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:01,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:34:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205622035] [2022-12-06 06:34:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:01,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:34:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:34:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:34:01,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:34:01,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 161 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:01,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:01,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:34:01,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:01,544 INFO L130 PetriNetUnfolder]: 181/359 cut-off events. [2022-12-06 06:34:01,544 INFO L131 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2022-12-06 06:34:01,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 359 events. 181/359 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1357 event pairs, 47 based on Foata normal form. 7/366 useless extension candidates. Maximal degree in co-relation 1258. Up to 197 conditions per place. [2022-12-06 06:34:01,546 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 34 selfloop transitions, 7 changer transitions 13/54 dead transitions. [2022-12-06 06:34:01,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 386 flow [2022-12-06 06:34:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:34:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:34:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-06 06:34:01,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2022-12-06 06:34:01,547 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 161 flow. Second operand 6 states and 43 transitions. [2022-12-06 06:34:01,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 386 flow [2022-12-06 06:34:01,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 358 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:01,549 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 176 flow [2022-12-06 06:34:01,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-06 06:34:01,550 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2022-12-06 06:34:01,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:01,550 INFO L89 Accepts]: Start accepts. Operand has 45 places, 31 transitions, 176 flow [2022-12-06 06:34:01,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:01,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:01,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 176 flow [2022-12-06 06:34:01,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 176 flow [2022-12-06 06:34:01,559 INFO L130 PetriNetUnfolder]: 24/100 cut-off events. [2022-12-06 06:34:01,559 INFO L131 PetriNetUnfolder]: For 112/132 co-relation queries the response was YES. [2022-12-06 06:34:01,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 100 events. 24/100 cut-off events. For 112/132 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 394 event pairs, 5 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 271. Up to 41 conditions per place. [2022-12-06 06:34:01,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 176 flow [2022-12-06 06:34:01,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 06:34:01,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:34:01,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 06:34:01,717 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 180 flow [2022-12-06 06:34:01,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:01,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:01,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:01,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:34:01,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2006135986, now seen corresponding path program 1 times [2022-12-06 06:34:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:01,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130159409] [2022-12-06 06:34:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:01,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130159409] [2022-12-06 06:34:01,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130159409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:01,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:01,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:34:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400936406] [2022-12-06 06:34:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:34:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:34:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:34:01,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:34:01,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:01,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:01,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:34:01,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:01,979 INFO L130 PetriNetUnfolder]: 130/261 cut-off events. [2022-12-06 06:34:01,979 INFO L131 PetriNetUnfolder]: For 294/295 co-relation queries the response was YES. [2022-12-06 06:34:01,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 261 events. 130/261 cut-off events. For 294/295 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 964 event pairs, 36 based on Foata normal form. 17/276 useless extension candidates. Maximal degree in co-relation 871. Up to 104 conditions per place. [2022-12-06 06:34:01,981 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 10 changer transitions 10/47 dead transitions. [2022-12-06 06:34:01,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 343 flow [2022-12-06 06:34:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 06:34:01,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2022-12-06 06:34:01,982 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 180 flow. Second operand 5 states and 49 transitions. [2022-12-06 06:34:01,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 343 flow [2022-12-06 06:34:01,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 304 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 06:34:01,984 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 144 flow [2022-12-06 06:34:01,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2022-12-06 06:34:01,985 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2022-12-06 06:34:01,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:01,985 INFO L89 Accepts]: Start accepts. Operand has 45 places, 26 transitions, 144 flow [2022-12-06 06:34:01,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:01,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:01,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 26 transitions, 144 flow [2022-12-06 06:34:01,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 26 transitions, 144 flow [2022-12-06 06:34:01,990 INFO L130 PetriNetUnfolder]: 6/37 cut-off events. [2022-12-06 06:34:01,991 INFO L131 PetriNetUnfolder]: For 37/39 co-relation queries the response was YES. [2022-12-06 06:34:01,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 37 events. 6/37 cut-off events. For 37/39 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 105. Up to 13 conditions per place. [2022-12-06 06:34:01,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 26 transitions, 144 flow [2022-12-06 06:34:01,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 06:34:02,121 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] $Ultimate##0-->L820: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~x~0_5 1) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x~0] and [449] $Ultimate##0-->L747: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_39)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_16, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:34:02,820 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:34:02,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 836 [2022-12-06 06:34:02,821 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 132 flow [2022-12-06 06:34:02,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:02,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:02,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:02,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:34:02,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash 541412125, now seen corresponding path program 1 times [2022-12-06 06:34:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:02,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813355847] [2022-12-06 06:34:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:03,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813355847] [2022-12-06 06:34:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813355847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:03,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:03,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:34:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900233464] [2022-12-06 06:34:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:03,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:34:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:03,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:34:03,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:34:03,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:34:03,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 132 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:03,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:03,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:34:03,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:03,955 INFO L130 PetriNetUnfolder]: 48/107 cut-off events. [2022-12-06 06:34:03,955 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-12-06 06:34:03,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 107 events. 48/107 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 306 event pairs, 11 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 407. Up to 50 conditions per place. [2022-12-06 06:34:03,956 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 21 selfloop transitions, 4 changer transitions 20/45 dead transitions. [2022-12-06 06:34:03,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 364 flow [2022-12-06 06:34:03,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:34:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:34:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-12-06 06:34:03,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-06 06:34:03,958 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 132 flow. Second operand 6 states and 32 transitions. [2022-12-06 06:34:03,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 364 flow [2022-12-06 06:34:03,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 280 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-12-06 06:34:03,959 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 114 flow [2022-12-06 06:34:03,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-06 06:34:03,960 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:34:03,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:03,961 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 114 flow [2022-12-06 06:34:03,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:03,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:03,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 114 flow [2022-12-06 06:34:03,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 114 flow [2022-12-06 06:34:03,967 INFO L130 PetriNetUnfolder]: 10/37 cut-off events. [2022-12-06 06:34:03,967 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 06:34:03,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 37 events. 10/37 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 95. Up to 12 conditions per place. [2022-12-06 06:34:03,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 114 flow [2022-12-06 06:34:03,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 06:34:03,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] $Ultimate##0-->L747: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~x~0_67 1) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~x~0_67 v_~__unbuffered_p0_EAX~0_75)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_75, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_67, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~x~0, P0Thread1of1ForFork2_~arg.base] and [361] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~y~0_36 (ite .cse0 v_~y$w_buff0~0_35 (ite .cse1 v_~y$w_buff1~0_26 v_~y~0_37))) (= v_~y$r_buff1_thd3~0_19 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_76 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~y$r_buff1_thd3~0_20)) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= v_~y$r_buff0_thd3~0_23 (ite .cse4 0 v_~y$r_buff0_thd3~0_24)) (= v_~y$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_77))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_37, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:34:04,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] $Ultimate##0-->L803: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_454 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_140 256) 0)))) (and (= v_~weak$$choice2~0_140 |v_P1Thread1of1ForFork0_#t~nondet6#1_46|) (= v_~y$w_buff0~0_297 1) (= v_~y$flush_delayed~0_126 0) (= (ite (= (mod v_~y$w_buff0_used~0_456 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= (ite .cse0 v_~y$w_buff0_used~0_456 (ite .cse1 v_~y$w_buff0_used~0_456 0)) v_~y$w_buff1_used~0_421) (= v_~y~0_356 (ite .cse0 v_~y$mem_tmp~0_112 v_~__unbuffered_p1_EAX~0_84)) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_46| v_~weak$$choice0~0_102) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= (ite .cse0 v_~y$r_buff0_thd2~0_220 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_218 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_421 256) 0)) .cse1 (and .cse2 (= (mod v_~y$r_buff0_thd2~0_220 256) 0)))) v_~y$r_buff0_thd2~0_220 0)) v_~y$r_buff1_thd2~0_186) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_32| |v_P1Thread1of1ForFork0_~arg#1.offset_32|) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_130) (= v_~y$w_buff1~0_265 v_~y$w_buff0~0_299) (= v_~y$r_buff0_thd3~0_135 v_~y$r_buff1_thd3~0_140) (= v_~__unbuffered_p1_EAX~0_84 v_~y$w_buff0~0_297) (= v_~y$r_buff0_thd2~0_218 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~__unbuffered_p1_EBX~0_76 v_~x~0_69) (= |v_P1Thread1of1ForFork0_~arg#1.base_32| |v_P1Thread1of1ForFork0_#in~arg#1.base_32|) (= v_~y$r_buff0_thd1~0_156 v_~y$r_buff1_thd1~0_154) (= v_~y~0_357 v_~y$mem_tmp~0_112) (= v_~y$w_buff0_used~0_454 (ite .cse0 1 0)))) InVars {P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_46|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_456, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_46|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_32|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$w_buff0~0=v_~y$w_buff0~0_299, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y~0=v_~y~0_357, ~x~0=v_~x~0_69} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_32|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_454, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_32|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_154, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_112, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_140, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_297, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_135, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y$flush_delayed~0=v_~y$flush_delayed~0_126, ~y~0=v_~y~0_356, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_218, ~weak$$choice2~0=v_~weak$$choice2~0_140, ~x~0=v_~x~0_69, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [473] $Ultimate##0-->L827: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_143 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_138 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_468 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_469 256) 0)) .cse5)) (.cse2 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_434 256) 0))))) (and (= v_~x~0_71 1) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_137 256))) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_433 256) 0)))) 0 v_~y$r_buff1_thd3~0_143) v_~y$r_buff1_thd3~0_142) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_434) v_~y$w_buff1_used~0_433) (= v_~y$w_buff0_used~0_468 (ite .cse4 0 v_~y$w_buff0_used~0_469)) (= (ite .cse3 0 v_~y$r_buff0_thd3~0_138) v_~y$r_buff0_thd3~0_137) (= v_P2Thread1of1ForFork1_~arg.offset_25 |v_P2Thread1of1ForFork1_#in~arg.offset_25|) (= v_P2Thread1of1ForFork1_~arg.base_25 |v_P2Thread1of1ForFork1_#in~arg.base_25|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_~x~0_71 v_~__unbuffered_p0_EAX~0_79) (= v_~y~0_368 (ite .cse4 v_~y$w_buff0~0_307 (ite .cse2 v_~y$w_buff1~0_273 v_~y~0_369))) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_469, ~y$w_buff1~0=v_~y$w_buff1~0_273, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_138, ~y$w_buff0~0=v_~y$w_buff0~0_307, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~y~0=v_~y~0_369, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_434} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_468, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_25, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_142, ~y$w_buff1~0=v_~y$w_buff1~0_273, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_307, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~y~0=v_~y~0_368, ~x~0=v_~x~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_433} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] [2022-12-06 06:34:04,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] $Ultimate##0-->L803: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_454 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_140 256) 0)))) (and (= v_~weak$$choice2~0_140 |v_P1Thread1of1ForFork0_#t~nondet6#1_46|) (= v_~y$w_buff0~0_297 1) (= v_~y$flush_delayed~0_126 0) (= (ite (= (mod v_~y$w_buff0_used~0_456 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= (ite .cse0 v_~y$w_buff0_used~0_456 (ite .cse1 v_~y$w_buff0_used~0_456 0)) v_~y$w_buff1_used~0_421) (= v_~y~0_356 (ite .cse0 v_~y$mem_tmp~0_112 v_~__unbuffered_p1_EAX~0_84)) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_46| v_~weak$$choice0~0_102) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= (ite .cse0 v_~y$r_buff0_thd2~0_220 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_218 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_421 256) 0)) .cse1 (and .cse2 (= (mod v_~y$r_buff0_thd2~0_220 256) 0)))) v_~y$r_buff0_thd2~0_220 0)) v_~y$r_buff1_thd2~0_186) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_32| |v_P1Thread1of1ForFork0_~arg#1.offset_32|) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_130) (= v_~y$w_buff1~0_265 v_~y$w_buff0~0_299) (= v_~y$r_buff0_thd3~0_135 v_~y$r_buff1_thd3~0_140) (= v_~__unbuffered_p1_EAX~0_84 v_~y$w_buff0~0_297) (= v_~y$r_buff0_thd2~0_218 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~__unbuffered_p1_EBX~0_76 v_~x~0_69) (= |v_P1Thread1of1ForFork0_~arg#1.base_32| |v_P1Thread1of1ForFork0_#in~arg#1.base_32|) (= v_~y$r_buff0_thd1~0_156 v_~y$r_buff1_thd1~0_154) (= v_~y~0_357 v_~y$mem_tmp~0_112) (= v_~y$w_buff0_used~0_454 (ite .cse0 1 0)))) InVars {P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_46|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_456, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_46|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_32|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$w_buff0~0=v_~y$w_buff0~0_299, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y~0=v_~y~0_357, ~x~0=v_~x~0_69} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_32|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_454, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_32|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_154, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_112, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_140, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_297, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_135, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y$flush_delayed~0=v_~y$flush_delayed~0_126, ~y~0=v_~y~0_356, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_218, ~weak$$choice2~0=v_~weak$$choice2~0_140, ~x~0=v_~x~0_69, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [469] $Ultimate##0-->L747: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~x~0_67 1) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~x~0_67 v_~__unbuffered_p0_EAX~0_75)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_75, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_67, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~x~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:34:05,387 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:34:05,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1428 [2022-12-06 06:34:05,388 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 113 flow [2022-12-06 06:34:05,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:05,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:05,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:05,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:34:05,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 147276193, now seen corresponding path program 1 times [2022-12-06 06:34:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:05,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70680547] [2022-12-06 06:34:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:06,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70680547] [2022-12-06 06:34:06,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70680547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:06,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:06,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:34:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431835632] [2022-12-06 06:34:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:06,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:34:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:06,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:34:06,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:34:06,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:34:06,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 113 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:06,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:06,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:34:06,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:06,171 INFO L130 PetriNetUnfolder]: 28/67 cut-off events. [2022-12-06 06:34:06,171 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 06:34:06,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 67 events. 28/67 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 175 event pairs, 2 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 245. Up to 30 conditions per place. [2022-12-06 06:34:06,172 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 22 selfloop transitions, 7 changer transitions 12/41 dead transitions. [2022-12-06 06:34:06,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 305 flow [2022-12-06 06:34:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:34:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:34:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-06 06:34:06,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 06:34:06,173 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 113 flow. Second operand 6 states and 27 transitions. [2022-12-06 06:34:06,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 305 flow [2022-12-06 06:34:06,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 286 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 06:34:06,174 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 127 flow [2022-12-06 06:34:06,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 06:34:06,175 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 06:34:06,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:06,175 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 127 flow [2022-12-06 06:34:06,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:06,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:06,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 127 flow [2022-12-06 06:34:06,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 127 flow [2022-12-06 06:34:06,181 INFO L130 PetriNetUnfolder]: 9/34 cut-off events. [2022-12-06 06:34:06,181 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 06:34:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 34 events. 9/34 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 98. Up to 12 conditions per place. [2022-12-06 06:34:06,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 127 flow [2022-12-06 06:34:06,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 06:34:06,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] $Ultimate##0-->L763: Formula: (let ((.cse6 (not (= (mod |v_P1Thread1of1ForFork0_#t~nondet6#1_58| 256) 0)))) (let ((.cse1 (ite .cse6 1 0))) (let ((.cse9 (= (mod .cse1 256) 0))) (let ((.cse16 (ite .cse6 v_~y$w_buff0_used~0_484 (ite .cse9 v_~y$w_buff0_used~0_484 0)))) (let ((.cse8 (= (mod .cse16 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd1~0_163 256) 0))) (let ((.cse14 (not .cse12)) (.cse10 (not .cse9)) (.cse17 (and .cse8 .cse12))) (let ((.cse2 (or .cse17 .cse12 .cse9)) (.cse5 (ite .cse6 v_~y~0_384 v_~__unbuffered_p1_EAX~0_92)) (.cse3 (and .cse14 .cse10))) (let ((.cse4 (ite .cse2 .cse5 (ite .cse3 v_~__unbuffered_p1_EAX~0_92 v_~y$w_buff1~0_279))) (.cse11 (= (mod v_~y$w_buff1_used~0_443 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_146 256) 0))) (.cse13 (= (mod v_~y$w_buff0_used~0_482 256) 0))) (and (= v_~y$w_buff0_used~0_482 (ite .cse0 .cse1 (ite .cse2 .cse1 (ite .cse3 0 .cse1)))) (= v_~__unbuffered_p0_EBX~0_104 .cse4) (= (ite (= (mod v_~y$w_buff0_used~0_484 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_~y$r_buff0_thd3~0_147 v_~y$r_buff1_thd3~0_152) (= |v_P0Thread1of1ForFork2_#in~arg.offset_25| v_P0Thread1of1ForFork2_~arg.offset_25) (= .cse5 v_~y$mem_tmp~0_118) (= v_~y$w_buff1~0_279 v_~y$w_buff0~0_319) (= v_~y$r_buff0_thd0~0_148 v_~y$r_buff1_thd0~0_144) (= v_~x~0_81 v_~__unbuffered_p0_EAX~0_85) (= v_~y$r_buff1_thd2~0_194 (ite .cse6 v_~y$r_buff0_thd2~0_233 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_232 256) 0))) (or (and .cse7 (= (mod v_~y$r_buff0_thd2~0_233 256) 0)) (and .cse8 .cse7) .cse9)) v_~y$r_buff0_thd2~0_233 0))) (= v_P2Thread1of1ForFork1_~arg.base_31 |v_P2Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork0_~arg#1.base_38| |v_P1Thread1of1ForFork0_#in~arg#1.base_38|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_38| |v_P1Thread1of1ForFork0_~arg#1.offset_38|) (= v_~x~0_81 1) (= v_~__unbuffered_p1_EBX~0_84 v_~x~0_82) (= v_~y$flush_delayed~0_132 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_~__unbuffered_p1_EAX~0_92 v_~y$w_buff0~0_317) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| 0)) (= v_~__unbuffered_p1_EAX~0_92 1) (= v_~y$r_buff0_thd2~0_232 (ite .cse6 1 (ite .cse9 1 (ite .cse10 0 1)))) (= (ite .cse0 v_~y$r_buff0_thd1~0_163 (ite (or (and .cse11 .cse12) .cse13 .cse12) v_~y$r_buff0_thd1~0_163 (ite (and .cse14 (not .cse13)) 0 v_~y$r_buff0_thd1~0_163))) v_~y$r_buff0_thd1~0_162) (= v_~y~0_382 (ite .cse0 v_~y$mem_tmp~0_118 .cse4)) (= v_~weak$$choice2~0_146 |v_P0Thread1of1ForFork2_#t~nondet4_90|) (= v_~y$r_buff1_thd1~0_160 (ite .cse0 v_~y$r_buff0_thd1~0_163 (ite (let ((.cse15 (= (mod v_~y$r_buff0_thd1~0_162 256) 0))) (or .cse13 (and .cse15 .cse11) (and .cse15 .cse12))) v_~y$r_buff0_thd1~0_163 0))) (= v_P2Thread1of1ForFork1_~arg.offset_31 |v_P2Thread1of1ForFork1_#in~arg.offset_31|) (= |v_P0Thread1of1ForFork2_#t~nondet3_90| v_~weak$$choice0~0_108) (= (ite .cse0 .cse16 (ite (or .cse13 .cse17 .cse12) .cse16 0)) v_~y$w_buff1_used~0_443) (= v_P0Thread1of1ForFork2_~arg.base_25 |v_P0Thread1of1ForFork2_#in~arg.base_25|)))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_484, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_58|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_38|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_38|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_163, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_233, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~y~0=v_~y~0_384, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_90|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_90|, ~x~0=v_~x~0_82} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_482, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_38|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_160, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_38|, ~y$mem_tmp~0=v_~y$mem_tmp~0_118, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_162, ~y$flush_delayed~0=v_~y$flush_delayed~0_132, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_25, ~y~0=v_~y~0_382, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_38|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_84, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_57|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_31, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_194, ~weak$$choice0~0=v_~weak$$choice0~0_108, ~y$w_buff1~0=v_~y$w_buff1~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_232, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~x~0=v_~x~0_81, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~nondet3, ~y$w_buff1_used~0] and [361] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~y~0_36 (ite .cse0 v_~y$w_buff0~0_35 (ite .cse1 v_~y$w_buff1~0_26 v_~y~0_37))) (= v_~y$r_buff1_thd3~0_19 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_76 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~y$r_buff1_thd3~0_20)) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= v_~y$r_buff0_thd3~0_23 (ite .cse4 0 v_~y$r_buff0_thd3~0_24)) (= v_~y$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_77))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_37, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:34:06,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] $Ultimate##0-->L827: Formula: (let ((.cse3 (not (= (mod v_~weak$$choice2~0_142 256) 0)))) (let ((.cse1 (ite .cse3 1 0))) (let ((.cse4 (= (mod .cse1 256) 0))) (let ((.cse10 (ite .cse3 v_~y$w_buff0_used~0_474 (ite .cse4 v_~y$w_buff0_used~0_474 0)))) (let ((.cse7 (not (= (mod v_~y$w_buff0_used~0_472 256) 0))) (.cse6 (= (mod .cse10 256) 0)) (.cse11 (not .cse4)) (.cse8 (not (= (mod v_~y$r_buff0_thd3~0_142 256) 0)))) (let ((.cse0 (and .cse11 .cse8)) (.cse2 (and (not .cse6) .cse8)) (.cse9 (and .cse7 .cse8))) (and (= v_~x~0_73 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~y$r_buff0_thd1~0_158 v_~y$r_buff1_thd1~0_156) (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= v_~y$w_buff0_used~0_472 (ite .cse0 0 .cse1)) (= v_~y$w_buff0~0_309 1) (= (ite (= (mod v_~y$w_buff0_used~0_474 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_38|) (= v_~y~0_374 v_~y$mem_tmp~0_114) (= (ite .cse0 v_~y$w_buff0~0_309 (ite .cse2 v_~y$w_buff1~0_275 (ite .cse3 v_~y$mem_tmp~0_114 v_~__unbuffered_p1_EAX~0_88))) v_~y~0_372) (= |v_P1Thread1of1ForFork0_~arg#1.base_34| |v_P1Thread1of1ForFork0_#in~arg#1.base_34|) (= v_~y$r_buff0_thd0~0_144 v_~y$r_buff1_thd0~0_140) (= v_~__unbuffered_p1_EAX~0_88 v_~y$w_buff0~0_309) (= (ite .cse3 v_~y$r_buff0_thd2~0_225 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd2~0_224 256) 0))) (or .cse4 (and (= (mod v_~y$r_buff0_thd2~0_225 256) 0) .cse5) (and .cse6 .cse5))) v_~y$r_buff0_thd2~0_225 0)) v_~y$r_buff1_thd2~0_190) (= v_~y$w_buff1~0_275 v_~y$w_buff0~0_310) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= v_~y$r_buff1_thd3~0_146 (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_141 256) 0)) .cse7) (and (not (= (mod v_~y$w_buff1_used~0_437 256) 0)) .cse8)) 0 v_~y$r_buff0_thd3~0_142)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_34| |v_P1Thread1of1ForFork0_~arg#1.offset_34|) (= v_~y$w_buff1_used~0_437 (ite (or .cse2 .cse9) 0 .cse10)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_38| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_38|) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_50| v_~weak$$choice0~0_104) (= (ite .cse9 0 v_~y$r_buff0_thd3~0_142) v_~y$r_buff0_thd3~0_141) (= v_~__unbuffered_p1_EBX~0_80 v_~x~0_74) (= v_~x~0_73 v_~__unbuffered_p0_EAX~0_81) (= (ite .cse3 1 (ite .cse4 1 (ite .cse11 0 1))) v_~y$r_buff0_thd2~0_224) (= v_~y$flush_delayed~0_128 0) (= v_~weak$$choice2~0_142 |v_P1Thread1of1ForFork0_#t~nondet6#1_50|) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_38| 0))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_474, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_50|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_142, ~y$w_buff0~0=v_~y$w_buff0~0_310, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_158, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~y~0=v_~y~0_374, ~x~0=v_~x~0_74} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_34|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_472, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_38|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_156, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_81, ~y$mem_tmp~0=v_~y$mem_tmp~0_114, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_146, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_141, ~y$w_buff0~0=v_~y$w_buff0~0_309, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_158, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_128, ~y~0=v_~y~0_372, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_38|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_34|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_80, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_190, ~weak$$choice0~0=v_~weak$$choice0~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_275, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_224, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x~0=v_~x~0_73, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_437} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [346] L747-->L763: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_34 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_42 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse8 .cse11)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_139 256) 0) .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~y~0_98 (ite .cse6 v_~y$w_buff0~0_80 v_~y$w_buff1~0_69))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_60 256)))) (.cse7 (= (mod v_~y$w_buff1_used~0_138 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_147 256) 0))) (and (= v_~y$w_buff0~0_80 v_~y$w_buff0~0_79) (= v_~y~0_96 (ite .cse0 v_~y$mem_tmp~0_34 .cse1)) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_24) (= (ite .cse0 v_~y$w_buff1_used~0_139 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_139 0)) v_~y$w_buff1_used~0_138) (= v_~y$w_buff0_used~0_147 (ite .cse0 v_~y$w_buff0_used~0_148 (ite .cse5 v_~y$w_buff0_used~0_148 (ite .cse6 0 v_~y$w_buff0_used~0_148)))) (= v_~y$w_buff1~0_69 v_~y$w_buff1~0_68) (= v_~y$r_buff0_thd1~0_41 (ite .cse0 v_~y$r_buff0_thd1~0_42 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~y$r_buff0_thd1~0_42 (ite (and (not .cse4) .cse9) 0 v_~y$r_buff0_thd1~0_42)))) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_60) (= v_~__unbuffered_p0_EBX~0_6 .cse1) (= v_~y~0_98 v_~y$mem_tmp~0_34) (= 0 v_~y$flush_delayed~0_46) (= (ite .cse0 v_~y$r_buff1_thd1~0_34 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_41 256) 0))) (or (and .cse7 .cse10) (and .cse10 .cse11) .cse4)) v_~y$r_buff1_thd1~0_34 0)) v_~y$r_buff1_thd1~0_33)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_148, ~y$w_buff1~0=v_~y$w_buff1~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_42, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, ~y~0=v_~y~0_98, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_33, ~weak$$choice0~0=v_~weak$$choice0~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_68, ~y$w_buff0~0=v_~y$w_buff0~0_79, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, ~y~0=v_~y~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3, ~y$w_buff1_used~0] [2022-12-06 06:34:07,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] $Ultimate##0-->L763: Formula: (let ((.cse6 (not (= (mod |v_P1Thread1of1ForFork0_#t~nondet6#1_58| 256) 0)))) (let ((.cse1 (ite .cse6 1 0))) (let ((.cse9 (= (mod .cse1 256) 0))) (let ((.cse16 (ite .cse6 v_~y$w_buff0_used~0_484 (ite .cse9 v_~y$w_buff0_used~0_484 0)))) (let ((.cse8 (= (mod .cse16 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd1~0_163 256) 0))) (let ((.cse14 (not .cse12)) (.cse10 (not .cse9)) (.cse17 (and .cse8 .cse12))) (let ((.cse2 (or .cse17 .cse12 .cse9)) (.cse5 (ite .cse6 v_~y~0_384 v_~__unbuffered_p1_EAX~0_92)) (.cse3 (and .cse14 .cse10))) (let ((.cse4 (ite .cse2 .cse5 (ite .cse3 v_~__unbuffered_p1_EAX~0_92 v_~y$w_buff1~0_279))) (.cse11 (= (mod v_~y$w_buff1_used~0_443 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_146 256) 0))) (.cse13 (= (mod v_~y$w_buff0_used~0_482 256) 0))) (and (= v_~y$w_buff0_used~0_482 (ite .cse0 .cse1 (ite .cse2 .cse1 (ite .cse3 0 .cse1)))) (= v_~__unbuffered_p0_EBX~0_104 .cse4) (= (ite (= (mod v_~y$w_buff0_used~0_484 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_~y$r_buff0_thd3~0_147 v_~y$r_buff1_thd3~0_152) (= |v_P0Thread1of1ForFork2_#in~arg.offset_25| v_P0Thread1of1ForFork2_~arg.offset_25) (= .cse5 v_~y$mem_tmp~0_118) (= v_~y$w_buff1~0_279 v_~y$w_buff0~0_319) (= v_~y$r_buff0_thd0~0_148 v_~y$r_buff1_thd0~0_144) (= v_~x~0_81 v_~__unbuffered_p0_EAX~0_85) (= v_~y$r_buff1_thd2~0_194 (ite .cse6 v_~y$r_buff0_thd2~0_233 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_232 256) 0))) (or (and .cse7 (= (mod v_~y$r_buff0_thd2~0_233 256) 0)) (and .cse8 .cse7) .cse9)) v_~y$r_buff0_thd2~0_233 0))) (= v_P2Thread1of1ForFork1_~arg.base_31 |v_P2Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork0_~arg#1.base_38| |v_P1Thread1of1ForFork0_#in~arg#1.base_38|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_38| |v_P1Thread1of1ForFork0_~arg#1.offset_38|) (= v_~x~0_81 1) (= v_~__unbuffered_p1_EBX~0_84 v_~x~0_82) (= v_~y$flush_delayed~0_132 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_~__unbuffered_p1_EAX~0_92 v_~y$w_buff0~0_317) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| 0)) (= v_~__unbuffered_p1_EAX~0_92 1) (= v_~y$r_buff0_thd2~0_232 (ite .cse6 1 (ite .cse9 1 (ite .cse10 0 1)))) (= (ite .cse0 v_~y$r_buff0_thd1~0_163 (ite (or (and .cse11 .cse12) .cse13 .cse12) v_~y$r_buff0_thd1~0_163 (ite (and .cse14 (not .cse13)) 0 v_~y$r_buff0_thd1~0_163))) v_~y$r_buff0_thd1~0_162) (= v_~y~0_382 (ite .cse0 v_~y$mem_tmp~0_118 .cse4)) (= v_~weak$$choice2~0_146 |v_P0Thread1of1ForFork2_#t~nondet4_90|) (= v_~y$r_buff1_thd1~0_160 (ite .cse0 v_~y$r_buff0_thd1~0_163 (ite (let ((.cse15 (= (mod v_~y$r_buff0_thd1~0_162 256) 0))) (or .cse13 (and .cse15 .cse11) (and .cse15 .cse12))) v_~y$r_buff0_thd1~0_163 0))) (= v_P2Thread1of1ForFork1_~arg.offset_31 |v_P2Thread1of1ForFork1_#in~arg.offset_31|) (= |v_P0Thread1of1ForFork2_#t~nondet3_90| v_~weak$$choice0~0_108) (= (ite .cse0 .cse16 (ite (or .cse13 .cse17 .cse12) .cse16 0)) v_~y$w_buff1_used~0_443) (= v_P0Thread1of1ForFork2_~arg.base_25 |v_P0Thread1of1ForFork2_#in~arg.base_25|)))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_484, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_58|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_38|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_38|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_163, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_233, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~y~0=v_~y~0_384, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_90|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_90|, ~x~0=v_~x~0_82} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_482, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_38|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_160, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_38|, ~y$mem_tmp~0=v_~y$mem_tmp~0_118, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_162, ~y$flush_delayed~0=v_~y$flush_delayed~0_132, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_25, ~y~0=v_~y~0_382, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_31|, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_38|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_84, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_57|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_31, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_194, ~weak$$choice0~0=v_~weak$$choice0~0_108, ~y$w_buff1~0=v_~y$w_buff1~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_232, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_31|, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~x~0=v_~x~0_81, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~nondet3, ~y$w_buff1_used~0] and [355] L803-->L810: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse0 (not (= 0 (mod v_~y$r_buff1_thd2~0_54 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_63 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse3 (and (not (= 0 (mod v_~y$w_buff1_used~0_127 256))) .cse0)) (.cse2 (and .cse5 .cse1))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_126 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_62 256) 0)))) 0 v_~y$r_buff1_thd2~0_54) v_~y$r_buff1_thd2~0_53) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_127) v_~y$w_buff1_used~0_126) (= (ite .cse4 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= (ite .cse4 v_~y$w_buff0~0_71 (ite .cse3 v_~y$w_buff1~0_60 v_~y~0_83)) v_~y~0_82) (= v_~y$r_buff0_thd2~0_62 (ite .cse2 0 v_~y$r_buff0_thd2~0_63))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_127} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y~0=v_~y~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_126} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:34:08,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] $Ultimate##0-->L810: Formula: (let ((.cse21 (not (= (mod |v_P1Thread1of1ForFork0_#t~nondet6#1_70| 256) 0)))) (let ((.cse28 (ite .cse21 1 0))) (let ((.cse23 (= (mod .cse28 256) 0))) (let ((.cse25 (ite .cse21 v_~y$w_buff0_used~0_502 (ite .cse23 v_~y$w_buff0_used~0_502 0)))) (let ((.cse24 (= (mod .cse25 256) 0)) (.cse11 (= (mod v_~y$r_buff0_thd1~0_175 256) 0))) (let ((.cse14 (not .cse11)) (.cse27 (not .cse23)) (.cse26 (and .cse24 .cse11))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_156 256) 0))) (.cse19 (or .cse23 .cse11 .cse26)) (.cse20 (and .cse14 .cse27))) (let ((.cse17 (ite .cse2 .cse28 (ite .cse19 .cse28 (ite .cse20 0 .cse28)))) (.cse9 (ite .cse21 1 (ite .cse23 1 (ite .cse27 0 1))))) (let ((.cse22 (= (mod .cse9 256) 0)) (.cse12 (= (mod .cse17 256) 0))) (let ((.cse8 (ite .cse2 .cse25 (ite (or .cse11 .cse12 .cse26) .cse25 0))) (.cse6 (ite .cse21 v_~y$r_buff0_thd2~0_246 (ite (or .cse23 (and .cse22 .cse24) (and .cse22 (= (mod v_~y$r_buff0_thd2~0_246 256) 0))) v_~y$r_buff0_thd2~0_246 0)))) (let ((.cse15 (not .cse12)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_500 256) 0))) (.cse18 (not .cse22)) (.cse5 (not (= (mod .cse6 256) 0))) (.cse13 (= (mod .cse8 256) 0)) (.cse10 (ite .cse21 v_~y~0_402 v_~__unbuffered_p1_EAX~0_98))) (let ((.cse3 (ite .cse19 .cse10 (ite .cse20 v_~__unbuffered_p1_EAX~0_98 v_~y$w_buff1~0_289))) (.cse1 (and .cse5 (not .cse13))) (.cse7 (and .cse4 .cse18)) (.cse0 (and .cse15 .cse18))) (and (= v_~y~0_400 (ite .cse0 v_~y$w_buff0~0_333 (ite .cse1 v_~y$w_buff1~0_289 (ite .cse2 v_~y$mem_tmp~0_128 .cse3)))) (= v_P2Thread1of1ForFork1_~arg.base_37 |v_P2Thread1of1ForFork1_#in~arg.base_37|) (= v_~x~0_93 v_~__unbuffered_p0_EAX~0_91) (= v_~__unbuffered_p1_EAX~0_98 1) (= v_~__unbuffered_p0_EBX~0_110 .cse3) (= v_~y$r_buff1_thd2~0_200 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_244 256) 0)) .cse4) (and .cse5 (not (= 0 (mod v_~y$w_buff1_used~0_455 256))))) 0 .cse6)) (= v_~y$w_buff1_used~0_455 (ite (or .cse1 .cse7) 0 .cse8)) (= v_~y$r_buff0_thd2~0_244 (ite .cse7 0 .cse9)) (= |v_P1Thread1of1ForFork0_~arg#1.base_44| |v_P1Thread1of1ForFork0_#in~arg#1.base_44|) (= v_~weak$$choice2~0_156 |v_P0Thread1of1ForFork2_#t~nondet4_102|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_31| v_P0Thread1of1ForFork2_~arg.offset_31) (= v_~y$mem_tmp~0_128 .cse10) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|) (= v_~y$r_buff0_thd1~0_174 (ite .cse2 v_~y$r_buff0_thd1~0_175 (ite (or .cse11 .cse12 (and .cse11 .cse13)) v_~y$r_buff0_thd1~0_175 (ite (and .cse14 .cse15) 0 v_~y$r_buff0_thd1~0_175)))) (= v_~y$r_buff0_thd3~0_157 v_~y$r_buff1_thd3~0_160) (= v_P2Thread1of1ForFork1_~arg.offset_37 |v_P2Thread1of1ForFork1_#in~arg.offset_37|) (= v_~y$r_buff0_thd0~0_154 v_~y$r_buff1_thd0~0_150) (= v_~y$r_buff1_thd1~0_170 (ite .cse2 v_~y$r_buff0_thd1~0_175 (ite (let ((.cse16 (= (mod v_~y$r_buff0_thd1~0_174 256) 0))) (or (and .cse11 .cse16) .cse12 (and .cse13 .cse16))) v_~y$r_buff0_thd1~0_175 0))) (= v_~y$w_buff1~0_289 v_~y$w_buff0~0_334) (= v_~x~0_93 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_44| |v_P1Thread1of1ForFork0_~arg#1.offset_44|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48| 0)) (= v_~weak$$choice0~0_118 |v_P0Thread1of1ForFork2_#t~nondet3_102|) (= v_~__unbuffered_p1_EAX~0_98 v_~y$w_buff0~0_333) (= (ite (= 0 (mod v_~y$w_buff0_used~0_502 256)) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|) (= v_~__unbuffered_p1_EBX~0_90 v_~x~0_94) (= v_~y$w_buff0_used~0_500 (ite .cse0 0 .cse17)) (= v_P0Thread1of1ForFork2_~arg.base_31 |v_P0Thread1of1ForFork2_#in~arg.base_31|) (= v_~y$flush_delayed~0_142 0)))))))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_502, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_31|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_70|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_31|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_157, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_246, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_175, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_37|, ~y~0=v_~y~0_402, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_102|, ~x~0=v_~x~0_94, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_102|} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_44|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_500, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_170, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, ~y$mem_tmp~0=v_~y$mem_tmp~0_128, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_160, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_37, ~y$w_buff0~0=v_~y$w_buff0~0_333, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_157, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_174, ~y$flush_delayed~0=v_~y$flush_delayed~0_142, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_31, ~y~0=v_~y~0_400, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_37|, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_110, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_67|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_37, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_200, ~weak$$choice0~0=v_~weak$$choice0~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_289, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_244, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_37|, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~x~0=v_~x~0_93, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_455} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~nondet3, ~y$w_buff1_used~0] and [361] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~y~0_36 (ite .cse0 v_~y$w_buff0~0_35 (ite .cse1 v_~y$w_buff1~0_26 v_~y~0_37))) (= v_~y$r_buff1_thd3~0_19 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_76 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~y$r_buff1_thd3~0_20)) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= v_~y$r_buff0_thd3~0_23 (ite .cse4 0 v_~y$r_buff0_thd3~0_24)) (= v_~y$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_77))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_37, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:34:09,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] $Ultimate##0-->L827: Formula: (let ((.cse1 (not (= (mod |v_P1Thread1of1ForFork0_#t~nondet6#1_62| 256) 0)))) (let ((.cse25 (ite .cse1 1 0))) (let ((.cse2 (= (mod .cse25 256) 0))) (let ((.cse23 (ite .cse1 v_~y$w_buff0_used~0_490 (ite .cse2 v_~y$w_buff0_used~0_490 0)))) (let ((.cse18 (= (mod .cse23 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd1~0_167 256) 0))) (let ((.cse9 (not .cse5)) (.cse3 (not .cse2)) (.cse24 (and .cse5 .cse18))) (let ((.cse4 (not (= (mod v_~weak$$choice2~0_150 256) 0))) (.cse21 (or .cse5 .cse2 .cse24)) (.cse22 (and .cse9 .cse3))) (let ((.cse19 (ite .cse4 .cse25 (ite .cse21 .cse25 (ite .cse22 0 .cse25))))) (let ((.cse6 (= (mod .cse19 256) 0))) (let ((.cse12 (ite .cse4 .cse23 (ite (or .cse5 .cse6 .cse24) .cse23 0)))) (let ((.cse8 (not .cse6)) (.cse13 (ite .cse1 v_~y~0_390 v_~__unbuffered_p1_EAX~0_94)) (.cse7 (= (mod .cse12 256) 0)) (.cse14 (not (= (mod v_~y$w_buff0_used~0_488 256) 0))) (.cse15 (not (= (mod v_~y$r_buff0_thd3~0_150 256) 0)))) (let ((.cse10 (and .cse14 .cse15)) (.cse11 (and .cse15 (not .cse7))) (.cse0 (ite .cse21 .cse13 (ite .cse22 v_~__unbuffered_p1_EAX~0_94 v_~y$w_buff1~0_283))) (.cse16 (and .cse8 .cse15))) (and (= v_~__unbuffered_p0_EBX~0_106 .cse0) (= |v_P1Thread1of1ForFork0_~arg#1.base_40| |v_P1Thread1of1ForFork0_#in~arg#1.base_40|) (= v_P2Thread1of1ForFork1_~arg.offset_33 |v_P2Thread1of1ForFork1_#in~arg.offset_33|) (= (ite .cse1 1 (ite .cse2 1 (ite .cse3 0 1))) v_~y$r_buff0_thd2~0_236) (= (ite (= (mod v_~y$w_buff0_used~0_490 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_44|) (= v_~x~0_85 v_~__unbuffered_p0_EAX~0_87) (= v_~y$w_buff1~0_283 v_~y$w_buff0~0_324) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_44| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_44|) (= v_P0Thread1of1ForFork2_~arg.base_27 |v_P0Thread1of1ForFork2_#in~arg.base_27|) (= v_~y$r_buff0_thd1~0_166 (ite .cse4 v_~y$r_buff0_thd1~0_167 (ite (or .cse5 .cse6 (and .cse5 .cse7)) v_~y$r_buff0_thd1~0_167 (ite (and .cse8 .cse9) 0 v_~y$r_buff0_thd1~0_167)))) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_44| 0)) (= (ite (or .cse10 .cse11) 0 .cse12) v_~y$w_buff1_used~0_447) (= (ite .cse10 0 v_~y$r_buff0_thd3~0_150) v_~y$r_buff0_thd3~0_149) (= v_~y$mem_tmp~0_122 .cse13) (= v_~y$r_buff1_thd3~0_154 (ite (or (and .cse14 (not (= (mod v_~y$r_buff0_thd3~0_149 256) 0))) (and .cse15 (not (= (mod v_~y$w_buff1_used~0_447 256) 0)))) 0 v_~y$r_buff0_thd3~0_150)) (= v_~y~0_388 (ite .cse16 v_~y$w_buff0~0_323 (ite .cse11 v_~y$w_buff1~0_283 (ite .cse4 v_~y$mem_tmp~0_122 .cse0)))) (= v_~__unbuffered_p1_EAX~0_94 1) (= v_~y$r_buff0_thd0~0_150 v_~y$r_buff1_thd0~0_146) (= v_P2Thread1of1ForFork1_~arg.base_33 |v_P2Thread1of1ForFork1_#in~arg.base_33|) (= (ite .cse1 v_~y$r_buff0_thd2~0_237 (ite (let ((.cse17 (= (mod v_~y$r_buff0_thd2~0_236 256) 0))) (or (and (= (mod v_~y$r_buff0_thd2~0_237 256) 0) .cse17) (and .cse18 .cse17) .cse2)) v_~y$r_buff0_thd2~0_237 0)) v_~y$r_buff1_thd2~0_196) (= v_~y$w_buff0_used~0_488 (ite .cse16 0 .cse19)) (= |v_P0Thread1of1ForFork2_#t~nondet3_94| v_~weak$$choice0~0_112) (= v_~y$r_buff1_thd1~0_164 (ite .cse4 v_~y$r_buff0_thd1~0_167 (ite (let ((.cse20 (= (mod v_~y$r_buff0_thd1~0_166 256) 0))) (or (and .cse5 .cse20) (and .cse20 .cse7) .cse6)) v_~y$r_buff0_thd1~0_167 0))) (= |v_P0Thread1of1ForFork2_#in~arg.offset_27| v_P0Thread1of1ForFork2_~arg.offset_27) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_40| |v_P1Thread1of1ForFork0_~arg#1.offset_40|) (= v_~__unbuffered_p1_EBX~0_86 v_~x~0_86) (= v_~weak$$choice2~0_150 |v_P0Thread1of1ForFork2_#t~nondet4_94|) (= v_~y$flush_delayed~0_136 0) (= v_~__unbuffered_p1_EAX~0_94 v_~y$w_buff0~0_323) (= v_~x~0_85 1)))))))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_490, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_27|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_62|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_27|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_150, ~y$w_buff0~0=v_~y$w_buff0~0_324, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_237, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_33|, ~y~0=v_~y~0_390, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_94|, ~x~0=v_~x~0_86, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_94|} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_40|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_488, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_44|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_27, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_164, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, ~y$mem_tmp~0=v_~y$mem_tmp~0_122, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_154, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_149, ~y$w_buff0~0=v_~y$w_buff0~0_323, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_166, ~y$flush_delayed~0=v_~y$flush_delayed~0_136, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_27, ~y~0=v_~y~0_388, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_33|, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_44|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_40|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_106, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_86, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_61|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_33, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_196, ~weak$$choice0~0=v_~weak$$choice0~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_236, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_33|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~x~0=v_~x~0_85, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_447} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~nondet3, ~y$w_buff1_used~0] and [355] L803-->L810: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse0 (not (= 0 (mod v_~y$r_buff1_thd2~0_54 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_63 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse3 (and (not (= 0 (mod v_~y$w_buff1_used~0_127 256))) .cse0)) (.cse2 (and .cse5 .cse1))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_126 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_62 256) 0)))) 0 v_~y$r_buff1_thd2~0_54) v_~y$r_buff1_thd2~0_53) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_127) v_~y$w_buff1_used~0_126) (= (ite .cse4 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= (ite .cse4 v_~y$w_buff0~0_71 (ite .cse3 v_~y$w_buff1~0_60 v_~y~0_83)) v_~y~0_82) (= v_~y$r_buff0_thd2~0_62 (ite .cse2 0 v_~y$r_buff0_thd2~0_63))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_127} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y~0=v_~y~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_126} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:34:10,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L763: Formula: (let ((.cse5 (not (= 0 (mod |v_P1Thread1of1ForFork0_#t~nondet6#1_66| 256))))) (let ((.cse26 (ite .cse5 1 0))) (let ((.cse8 (= 0 (mod .cse26 256)))) (let ((.cse17 (not (= (mod v_~y$r_buff0_thd3~0_154 256) 0))) (.cse19 (not .cse8))) (let ((.cse22 (and .cse17 .cse19))) (let ((.cse13 (ite .cse22 0 .cse26))) (let ((.cse25 (ite .cse5 v_~y$w_buff0_used~0_496 (ite .cse8 v_~y$w_buff0_used~0_496 0))) (.cse24 (= (mod .cse13 256) 0))) (let ((.cse16 (not .cse24)) (.cse7 (= (mod .cse25 256) 0))) (let ((.cse23 (and .cse17 (not .cse7))) (.cse12 (and .cse17 .cse16))) (let ((.cse10 (ite (or .cse23 .cse12) 0 .cse25))) (let ((.cse18 (= (mod .cse10 256) 0)) (.cse1 (= (mod v_~y$r_buff0_thd1~0_171 256) 0))) (let ((.cse4 (not .cse1)) (.cse11 (and .cse1 .cse18))) (let ((.cse14 (or .cse1 .cse24 .cse11)) (.cse21 (ite .cse22 v_~__unbuffered_p1_EAX~0_96 (ite .cse23 v_~y$w_buff0~0_329 (ite .cse5 v_~y~0_396 v_~__unbuffered_p1_EAX~0_96)))) (.cse15 (and .cse16 .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_451 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_494 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_152 256) 0))) (.cse20 (ite .cse14 .cse21 (ite .cse15 v_~__unbuffered_p1_EAX~0_96 v_~y$w_buff0~0_329)))) (and (= v_~y$r_buff0_thd1~0_170 (ite .cse0 v_~y$r_buff0_thd1~0_171 (ite (or .cse1 .cse2 (and .cse1 .cse3)) v_~y$r_buff0_thd1~0_171 (ite (and .cse4 (not .cse2)) 0 v_~y$r_buff0_thd1~0_171)))) (= (ite .cse5 v_~y$r_buff0_thd2~0_241 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd2~0_240 256) 0))) (or (and .cse6 (= (mod v_~y$r_buff0_thd2~0_241 256) 0)) (and .cse7 .cse6) .cse8)) v_~y$r_buff0_thd2~0_241 0)) v_~y$r_buff1_thd2~0_198) (= v_P0Thread1of1ForFork2_~arg.base_29 |v_P0Thread1of1ForFork2_#in~arg.base_29|) (= |v_P0Thread1of1ForFork2_#t~nondet3_98| v_~weak$$choice0~0_114) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_42| |v_P1Thread1of1ForFork0_~arg#1.offset_42|) (= v_~weak$$choice2~0_152 |v_P0Thread1of1ForFork2_#t~nondet4_98|) (= v_~x~0_89 1) (= (ite (= (mod v_~y$w_buff0_used~0_496 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|) (= (ite .cse0 v_~y$r_buff0_thd1~0_171 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd1~0_170 256) 0))) (or (and .cse9 .cse3) .cse2 (and .cse1 .cse9))) v_~y$r_buff0_thd1~0_171 0)) v_~y$r_buff1_thd1~0_166) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~y$w_buff1_used~0_451 (ite .cse0 .cse10 (ite (or .cse1 .cse2 .cse11) .cse10 0))) (= v_~y$w_buff1~0_285 v_~y$w_buff0~0_329) (= (ite .cse12 0 v_~y$r_buff0_thd3~0_154) v_~y$r_buff0_thd3~0_153) (= (ite .cse0 .cse13 (ite .cse14 .cse13 (ite .cse15 0 .cse13))) v_~y$w_buff0_used~0_494) (= |v_P1Thread1of1ForFork0_~arg#1.base_42| |v_P1Thread1of1ForFork0_#in~arg#1.base_42|) (= v_~y$r_buff1_thd3~0_158 (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_153 256) 0)) .cse16) (and .cse17 (not .cse18))) 0 v_~y$r_buff0_thd3~0_154)) (= v_~y$r_buff0_thd2~0_240 (ite .cse5 1 (ite .cse8 1 (ite .cse19 0 1)))) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|) (= v_~x~0_89 v_~__unbuffered_p0_EAX~0_89) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| 0)) (= |v_P0Thread1of1ForFork2_#in~arg.offset_29| v_P0Thread1of1ForFork2_~arg.offset_29) (= v_~__unbuffered_p1_EBX~0_88 v_~x~0_90) (= v_~__unbuffered_p1_EAX~0_96 v_~y$w_buff0~0_327) (= v_~y~0_394 (ite .cse0 v_~y$mem_tmp~0_124 .cse20)) (= v_~y$mem_tmp~0_124 .cse21) (= v_~y$flush_delayed~0_138 0) (= v_P2Thread1of1ForFork1_~arg.base_35 |v_P2Thread1of1ForFork1_#in~arg.base_35|) (= v_P2Thread1of1ForFork1_~arg.offset_35 |v_P2Thread1of1ForFork1_#in~arg.offset_35|) (= v_~y$r_buff0_thd0~0_152 v_~y$r_buff1_thd0~0_148) (= v_~__unbuffered_p0_EBX~0_108 .cse20)))))))))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_35|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_496, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_66|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_329, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_154, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_171, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_241, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_35|, ~y~0=v_~y~0_396, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_98|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_98|, ~x~0=v_~x~0_90} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_42|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_494, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_166, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~y$mem_tmp~0=v_~y$mem_tmp~0_124, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_158, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_35, ~y$w_buff0~0=v_~y$w_buff0~0_327, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_153, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_170, ~y$flush_delayed~0=v_~y$flush_delayed~0_138, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_29, ~y~0=v_~y~0_394, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_35|, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_42|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_108, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_63|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_35, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_198, ~weak$$choice0~0=v_~weak$$choice0~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_285, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_240, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_35|, ~weak$$choice2~0=v_~weak$$choice2~0_152, ~x~0=v_~x~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_451} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~nondet3, ~y$w_buff1_used~0] and [355] L803-->L810: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse0 (not (= 0 (mod v_~y$r_buff1_thd2~0_54 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_63 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse3 (and (not (= 0 (mod v_~y$w_buff1_used~0_127 256))) .cse0)) (.cse2 (and .cse5 .cse1))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_126 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_62 256) 0)))) 0 v_~y$r_buff1_thd2~0_54) v_~y$r_buff1_thd2~0_53) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_127) v_~y$w_buff1_used~0_126) (= (ite .cse4 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= (ite .cse4 v_~y$w_buff0~0_71 (ite .cse3 v_~y$w_buff1~0_60 v_~y~0_83)) v_~y~0_82) (= v_~y$r_buff0_thd2~0_62 (ite .cse2 0 v_~y$r_buff0_thd2~0_63))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_127} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y~0=v_~y~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_126} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:34:10,845 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:34:10,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4671 [2022-12-06 06:34:10,846 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 111 flow [2022-12-06 06:34:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:10,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:10,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:10,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:34:10,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:34:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2023521460, now seen corresponding path program 1 times [2022-12-06 06:34:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294354179] [2022-12-06 06:34:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:34:10,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:34:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:34:10,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:34:10,918 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:34:10,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:34:10,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:34:10,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:34:10,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:34:10,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:34:10,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:34:10,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:34:10,920 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:10,924 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:34:10,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:34:10,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:34:10 BasicIcfg [2022-12-06 06:34:10,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:34:10,953 INFO L158 Benchmark]: Toolchain (without parser) took 18106.67ms. Allocated memory was 183.5MB in the beginning and 678.4MB in the end (delta: 494.9MB). Free memory was 159.0MB in the beginning and 407.3MB in the end (delta: -248.3MB). Peak memory consumption was 247.7MB. Max. memory is 8.0GB. [2022-12-06 06:34:10,953 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 159.3MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:34:10,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.15ms. Allocated memory is still 183.5MB. Free memory was 159.0MB in the beginning and 131.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:34:10,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.41ms. Allocated memory is still 183.5MB. Free memory was 131.7MB in the beginning and 128.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:34:10,954 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 183.5MB. Free memory was 128.6MB in the beginning and 127.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:34:10,954 INFO L158 Benchmark]: RCFGBuilder took 585.35ms. Allocated memory is still 183.5MB. Free memory was 127.0MB in the beginning and 89.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:34:10,954 INFO L158 Benchmark]: TraceAbstraction took 16921.76ms. Allocated memory was 183.5MB in the beginning and 678.4MB in the end (delta: 494.9MB). Free memory was 88.7MB in the beginning and 407.3MB in the end (delta: -318.5MB). Peak memory consumption was 177.4MB. Max. memory is 8.0GB. [2022-12-06 06:34:10,955 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 159.3MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.15ms. Allocated memory is still 183.5MB. Free memory was 159.0MB in the beginning and 131.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.41ms. Allocated memory is still 183.5MB. Free memory was 131.7MB in the beginning and 128.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 183.5MB. Free memory was 128.6MB in the beginning and 127.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 585.35ms. Allocated memory is still 183.5MB. Free memory was 127.0MB in the beginning and 89.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16921.76ms. Allocated memory was 183.5MB in the beginning and 678.4MB in the end (delta: 494.9MB). Free memory was 88.7MB in the beginning and 407.3MB in the end (delta: -318.5MB). Peak memory consumption was 177.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 113 PlacesBefore, 35 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1800 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 1364, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1179, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1179, independent: 1136, independent conditional: 0, independent unconditional: 1136, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1416, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1179, unknown conditional: 0, unknown unconditional: 1179] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1779, Positive conditional cache size: 0, Positive unconditional cache size: 1779, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 65, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 65, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 146, dependent conditional: 22, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 65, unknown conditional: 6, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 46, Positive conditional cache size: 3, Positive unconditional cache size: 43, Negative cache size: 19, Negative conditional cache size: 3, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 50, Positive conditional cache size: 3, Positive unconditional cache size: 47, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 6, independent unconditional: 35, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 58, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 50, Positive conditional cache size: 3, Positive unconditional cache size: 47, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 61, independent conditional: 24, independent unconditional: 37, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 61, independent conditional: 6, independent unconditional: 55, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 61, independent conditional: 6, independent unconditional: 55, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 2, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 52, independent conditional: 4, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 59, Positive conditional cache size: 5, Positive unconditional cache size: 54, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 59, independent conditional: 22, independent unconditional: 37, dependent: 27, dependent conditional: 4, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 31, dependent conditional: 8, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 67, Positive conditional cache size: 5, Positive unconditional cache size: 62, Negative cache size: 32, Negative conditional cache size: 5, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 37, independent conditional: 10, independent unconditional: 27, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 37, independent conditional: 10, independent unconditional: 27, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 37, independent conditional: 10, independent unconditional: 27, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 3, independent unconditional: 10, 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: 14, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 24, independent conditional: 7, independent unconditional: 17, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 14, unknown conditional: 3, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 80, Positive conditional cache size: 8, Positive unconditional cache size: 72, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 44, independent conditional: 18, independent unconditional: 26, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 44, independent conditional: 18, independent unconditional: 26, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, 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: 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: 58, independent: 41, independent conditional: 17, independent unconditional: 24, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 83, Positive conditional cache size: 9, Positive unconditional cache size: 74, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, 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.2s, 45 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 65, independent conditional: 31, independent unconditional: 34, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 65, independent conditional: 31, independent unconditional: 34, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 65, independent conditional: 31, independent unconditional: 34, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 63, independent conditional: 31, independent unconditional: 32, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 88, Positive conditional cache size: 9, Positive unconditional cache size: 79, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 43 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 76, independent conditional: 58, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 76, independent conditional: 48, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 76, independent conditional: 48, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, 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: 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: 100, independent: 68, independent conditional: 43, independent unconditional: 25, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 107, Positive conditional cache size: 14, Positive unconditional cache size: 93, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 36 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 110, Positive conditional cache size: 16, Positive unconditional cache size: 94, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 35 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 16, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 117, Positive conditional cache size: 23, Positive unconditional cache size: 94, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - 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; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740, ((void *)0), P0, ((void *)0))=-2, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741, ((void *)0), P1, ((void *)0))=-1, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1742, ((void *)0), P2, ((void *)0))=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 [L802] 2 __unbuffered_p1_EBX = x [L819] 2 x = 1 [L746] 2 __unbuffered_p0_EAX = x [L822] 2 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 2 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 [L825] 2 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 2 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 [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 y$flush_delayed = weak$$choice2 [L752] 2 y$mem_tmp = y [L753] 2 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 2 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 2 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 2 __unbuffered_p0_EBX = y [L761] 2 y = y$flush_delayed ? y$mem_tmp : y [L762] 2 y$flush_delayed = (_Bool)0 [L805] 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) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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 [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: 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, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 636 IncrementalHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1 mSDtfsCounter, 636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=8, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:34:10,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...