/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:37:29,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:37:29,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:37:29,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:37:29,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:37:29,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:37:29,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:37:29,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:37:29,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:37:29,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:37:29,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:37:29,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:37:29,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:37:29,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:37:29,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:37:29,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:37:29,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:37:29,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:37:29,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:37:29,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:37:29,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:37:29,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:37:29,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:37:29,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:37:29,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:37:29,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:37:29,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:37:29,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:37:29,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:37:29,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:37:29,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:37:29,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:37:29,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:37:29,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:37:29,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:37:29,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:37:29,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:37:29,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:37:29,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:37:29,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:37:29,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:37:29,173 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:37:29,191 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:37:29,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:37:29,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:37:29,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:37:29,193 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:37:29,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:37:29,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:37:29,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:37:29,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:29,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:37:29,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:37:29,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:37:29,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:37:29,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:37:29,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:37:29,606 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:37:29,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:37:30,670 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:37:30,936 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:37:30,936 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:37:30,955 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923021f01/ed2f25890c8141b4ba18ec2a0975a72e/FLAG4f6f64f34 [2022-12-13 09:37:30,966 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923021f01/ed2f25890c8141b4ba18ec2a0975a72e [2022-12-13 09:37:30,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:37:30,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:37:30,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:30,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:37:30,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:37:30,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:30" (1/1) ... [2022-12-13 09:37:30,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5190dbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:30, skipping insertion in model container [2022-12-13 09:37:30,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:30" (1/1) ... [2022-12-13 09:37:30,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:37:31,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:37:31,122 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 09:37:31,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:31,214 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:37:31,225 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/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 09:37:31,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:31,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:31,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:31,311 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:37:31,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31 WrapperNode [2022-12-13 09:37:31,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:31,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:31,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:37:31,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:37:31,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,358 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2022-12-13 09:37:31,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:31,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:37:31,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:37:31,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:37:31,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,383 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:37:31,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:37:31,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:37:31,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:37:31,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (1/1) ... [2022-12-13 09:37:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:37:31,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:37:31,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:37:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:37:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:37:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:37:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:37:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:37:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:37:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:37:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:37:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:37:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:37:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:37:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:37:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:37:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:37:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:37:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:37:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:37:31,467 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:37:31,550 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:37:31,552 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:37:31,694 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:37:31,700 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:37:31,700 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:37:31,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:31 BoogieIcfgContainer [2022-12-13 09:37:31,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:37:31,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:37:31,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:37:31,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:37:31,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:37:30" (1/3) ... [2022-12-13 09:37:31,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7413434f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:31, skipping insertion in model container [2022-12-13 09:37:31,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:31" (2/3) ... [2022-12-13 09:37:31,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7413434f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:31, skipping insertion in model container [2022-12-13 09:37:31,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:31" (3/3) ... [2022-12-13 09:37:31,707 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:37:31,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:37:31,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:37:31,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:37:31,764 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:37:31,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 100 transitions, 220 flow [2022-12-13 09:37:31,852 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-12-13 09:37:31,852 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:31,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 09:37:31,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 100 transitions, 220 flow [2022-12-13 09:37:31,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 82 transitions, 176 flow [2022-12-13 09:37:31,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:31,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 82 transitions, 176 flow [2022-12-13 09:37:31,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 82 transitions, 176 flow [2022-12-13 09:37:31,948 INFO L130 PetriNetUnfolder]: 1/82 cut-off events. [2022-12-13 09:37:31,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:31,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 82 events. 1/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 09:37:31,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 82 transitions, 176 flow [2022-12-13 09:37:31,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-13 09:37:34,134 INFO L241 LiptonReduction]: Total number of compositions: 62 [2022-12-13 09:37:34,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:37:34,149 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;@728aeaaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:37:34,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:37:34,153 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 09:37:34,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:34,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:34,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:34,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash -560428226, now seen corresponding path program 1 times [2022-12-13 09:37:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:34,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829350626] [2022-12-13 09:37:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829350626] [2022-12-13 09:37:34,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829350626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:34,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:34,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169677915] [2022-12-13 09:37:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:34,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:37:34,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:34,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:34,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:37:34,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:34,980 INFO L130 PetriNetUnfolder]: 3805/5504 cut-off events. [2022-12-13 09:37:34,980 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2022-12-13 09:37:35,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11002 conditions, 5504 events. 3805/5504 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 28240 event pairs, 1069 based on Foata normal form. 16/4298 useless extension candidates. Maximal degree in co-relation 10990. Up to 5145 conditions per place. [2022-12-13 09:37:35,025 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 36 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-13 09:37:35,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 193 flow [2022-12-13 09:37:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 09:37:35,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:37:35,035 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 66 transitions. [2022-12-13 09:37:35,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 193 flow [2022-12-13 09:37:35,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:37:35,041 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 91 flow [2022-12-13 09:37:35,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 09:37:35,045 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-13 09:37:35,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:35,045 INFO L89 Accepts]: Start accepts. Operand has 44 places, 34 transitions, 91 flow [2022-12-13 09:37:35,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:35,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:35,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 91 flow [2022-12-13 09:37:35,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 91 flow [2022-12-13 09:37:35,057 INFO L130 PetriNetUnfolder]: 3/46 cut-off events. [2022-12-13 09:37:35,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:35,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 46 events. 3/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 129 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 61. Up to 10 conditions per place. [2022-12-13 09:37:35,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 34 transitions, 91 flow [2022-12-13 09:37:35,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 09:37:35,210 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:35,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 09:37:35,212 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 91 flow [2022-12-13 09:37:35,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:35,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:35,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:35,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:37:35,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -193406980, now seen corresponding path program 1 times [2022-12-13 09:37:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:35,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260469442] [2022-12-13 09:37:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:35,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260469442] [2022-12-13 09:37:35,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260469442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:35,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:35,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776982804] [2022-12-13 09:37:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:35,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:35,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:37:35,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:35,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:35,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:37:35,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:35,848 INFO L130 PetriNetUnfolder]: 3597/5234 cut-off events. [2022-12-13 09:37:35,848 INFO L131 PetriNetUnfolder]: For 631/631 co-relation queries the response was YES. [2022-12-13 09:37:35,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11343 conditions, 5234 events. 3597/5234 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26502 event pairs, 661 based on Foata normal form. 64/4124 useless extension candidates. Maximal degree in co-relation 11332. Up to 4297 conditions per place. [2022-12-13 09:37:35,878 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 35 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 09:37:35,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 193 flow [2022-12-13 09:37:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 09:37:35,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-13 09:37:35,879 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 91 flow. Second operand 3 states and 62 transitions. [2022-12-13 09:37:35,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 193 flow [2022-12-13 09:37:35,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:37:35,880 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 99 flow [2022-12-13 09:37:35,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2022-12-13 09:37:35,881 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-13 09:37:35,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:35,881 INFO L89 Accepts]: Start accepts. Operand has 46 places, 34 transitions, 99 flow [2022-12-13 09:37:35,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:35,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:35,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 99 flow [2022-12-13 09:37:35,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 99 flow [2022-12-13 09:37:35,886 INFO L130 PetriNetUnfolder]: 2/40 cut-off events. [2022-12-13 09:37:35,886 INFO L131 PetriNetUnfolder]: For 4/8 co-relation queries the response was YES. [2022-12-13 09:37:35,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 40 events. 2/40 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 119 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 57. Up to 8 conditions per place. [2022-12-13 09:37:35,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 99 flow [2022-12-13 09:37:35,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 09:37:35,899 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:35,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 09:37:35,900 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 99 flow [2022-12-13 09:37:35,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:35,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:35,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:35,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:37:35,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -193406422, now seen corresponding path program 1 times [2022-12-13 09:37:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:35,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852509574] [2022-12-13 09:37:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:36,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:36,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852509574] [2022-12-13 09:37:36,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852509574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:36,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:36,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52013450] [2022-12-13 09:37:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:36,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:37:36,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:36,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:36,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:37:36,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:36,344 INFO L130 PetriNetUnfolder]: 3389/4944 cut-off events. [2022-12-13 09:37:36,345 INFO L131 PetriNetUnfolder]: For 1453/1453 co-relation queries the response was YES. [2022-12-13 09:37:36,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11221 conditions, 4944 events. 3389/4944 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25139 event pairs, 1221 based on Foata normal form. 64/3882 useless extension candidates. Maximal degree in co-relation 11208. Up to 4129 conditions per place. [2022-12-13 09:37:36,375 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-13 09:37:36,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 221 flow [2022-12-13 09:37:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 09:37:36,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 09:37:36,377 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 99 flow. Second operand 3 states and 66 transitions. [2022-12-13 09:37:36,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 221 flow [2022-12-13 09:37:36,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:36,380 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 104 flow [2022-12-13 09:37:36,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-13 09:37:36,380 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-12-13 09:37:36,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:36,381 INFO L89 Accepts]: Start accepts. Operand has 47 places, 34 transitions, 104 flow [2022-12-13 09:37:36,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:36,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:36,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 104 flow [2022-12-13 09:37:36,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 104 flow [2022-12-13 09:37:36,384 INFO L130 PetriNetUnfolder]: 1/38 cut-off events. [2022-12-13 09:37:36,384 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-13 09:37:36,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 38 events. 1/38 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 115 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 55. Up to 6 conditions per place. [2022-12-13 09:37:36,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 104 flow [2022-12-13 09:37:36,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 09:37:36,394 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:36,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 09:37:36,395 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 104 flow [2022-12-13 09:37:36,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:36,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:36,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:37:36,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1700649684, now seen corresponding path program 1 times [2022-12-13 09:37:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:36,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747784660] [2022-12-13 09:37:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:36,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747784660] [2022-12-13 09:37:36,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747784660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:36,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:36,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:36,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354103838] [2022-12-13 09:37:36,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:36,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:36,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:37:36,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:36,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:36,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:37:36,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:36,908 INFO L130 PetriNetUnfolder]: 3907/5753 cut-off events. [2022-12-13 09:37:36,908 INFO L131 PetriNetUnfolder]: For 2479/2479 co-relation queries the response was YES. [2022-12-13 09:37:36,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13343 conditions, 5753 events. 3907/5753 cut-off events. For 2479/2479 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30929 event pairs, 437 based on Foata normal form. 64/4563 useless extension candidates. Maximal degree in co-relation 13329. Up to 3873 conditions per place. [2022-12-13 09:37:36,945 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2022-12-13 09:37:36,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 402 flow [2022-12-13 09:37:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:37:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:37:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-13 09:37:36,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 09:37:36,949 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 104 flow. Second operand 5 states and 116 transitions. [2022-12-13 09:37:36,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 402 flow [2022-12-13 09:37:36,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:36,956 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 198 flow [2022-12-13 09:37:36,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-13 09:37:36,958 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2022-12-13 09:37:36,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:36,958 INFO L89 Accepts]: Start accepts. Operand has 52 places, 44 transitions, 198 flow [2022-12-13 09:37:36,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:36,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:36,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 44 transitions, 198 flow [2022-12-13 09:37:36,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 198 flow [2022-12-13 09:37:36,969 INFO L130 PetriNetUnfolder]: 27/128 cut-off events. [2022-12-13 09:37:36,969 INFO L131 PetriNetUnfolder]: For 138/274 co-relation queries the response was YES. [2022-12-13 09:37:36,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 128 events. 27/128 cut-off events. For 138/274 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 656 event pairs, 6 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 295. Up to 42 conditions per place. [2022-12-13 09:37:36,971 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 198 flow [2022-12-13 09:37:36,971 INFO L226 LiptonReduction]: Number of co-enabled transitions 842 [2022-12-13 09:37:36,978 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:36,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 09:37:36,979 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 198 flow [2022-12-13 09:37:36,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:36,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:36,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:37:36,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1662980964, now seen corresponding path program 2 times [2022-12-13 09:37:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:36,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835539056] [2022-12-13 09:37:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:37,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:37,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835539056] [2022-12-13 09:37:37,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835539056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:37,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:37,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219328491] [2022-12-13 09:37:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:37,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:37,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 09:37:37,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:37,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:37,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 09:37:37,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:37,549 INFO L130 PetriNetUnfolder]: 4567/7015 cut-off events. [2022-12-13 09:37:37,550 INFO L131 PetriNetUnfolder]: For 9944/9966 co-relation queries the response was YES. [2022-12-13 09:37:37,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18756 conditions, 7015 events. 4567/7015 cut-off events. For 9944/9966 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 43827 event pairs, 847 based on Foata normal form. 272/5421 useless extension candidates. Maximal degree in co-relation 18739. Up to 2971 conditions per place. [2022-12-13 09:37:37,583 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 44 selfloop transitions, 5 changer transitions 14/72 dead transitions. [2022-12-13 09:37:37,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 404 flow [2022-12-13 09:37:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:37:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:37:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 09:37:37,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703125 [2022-12-13 09:37:37,585 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 198 flow. Second operand 4 states and 90 transitions. [2022-12-13 09:37:37,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 404 flow [2022-12-13 09:37:37,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:37:37,588 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 160 flow [2022-12-13 09:37:37,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2022-12-13 09:37:37,590 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-13 09:37:37,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:37,590 INFO L89 Accepts]: Start accepts. Operand has 56 places, 36 transitions, 160 flow [2022-12-13 09:37:37,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:37,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:37,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 36 transitions, 160 flow [2022-12-13 09:37:37,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 36 transitions, 160 flow [2022-12-13 09:37:37,597 INFO L130 PetriNetUnfolder]: 8/65 cut-off events. [2022-12-13 09:37:37,598 INFO L131 PetriNetUnfolder]: For 102/126 co-relation queries the response was YES. [2022-12-13 09:37:37,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 65 events. 8/65 cut-off events. For 102/126 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 227 event pairs, 5 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 147. Up to 18 conditions per place. [2022-12-13 09:37:37,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 36 transitions, 160 flow [2022-12-13 09:37:37,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 09:37:37,603 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:37,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 09:37:37,605 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 160 flow [2022-12-13 09:37:37,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:37,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:37,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:37,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:37:37,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash -847783905, now seen corresponding path program 1 times [2022-12-13 09:37:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:37,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221111698] [2022-12-13 09:37:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:37,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221111698] [2022-12-13 09:37:37,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221111698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:37,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:37,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895707361] [2022-12-13 09:37:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:37,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:37,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:37,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:37:37,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:37,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:37,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:37:37,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:38,005 INFO L130 PetriNetUnfolder]: 3333/5062 cut-off events. [2022-12-13 09:37:38,006 INFO L131 PetriNetUnfolder]: For 11545/11545 co-relation queries the response was YES. [2022-12-13 09:37:38,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14146 conditions, 5062 events. 3333/5062 cut-off events. For 11545/11545 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 26854 event pairs, 749 based on Foata normal form. 192/3930 useless extension candidates. Maximal degree in co-relation 14126. Up to 1937 conditions per place. [2022-12-13 09:37:38,022 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 39 selfloop transitions, 5 changer transitions 13/65 dead transitions. [2022-12-13 09:37:38,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 411 flow [2022-12-13 09:37:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:37:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:37:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 09:37:38,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2022-12-13 09:37:38,023 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 160 flow. Second operand 4 states and 83 transitions. [2022-12-13 09:37:38,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 411 flow [2022-12-13 09:37:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 361 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 09:37:38,028 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 155 flow [2022-12-13 09:37:38,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2022-12-13 09:37:38,029 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2022-12-13 09:37:38,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:38,029 INFO L89 Accepts]: Start accepts. Operand has 55 places, 36 transitions, 155 flow [2022-12-13 09:37:38,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:38,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:38,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 36 transitions, 155 flow [2022-12-13 09:37:38,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 36 transitions, 155 flow [2022-12-13 09:37:38,034 INFO L130 PetriNetUnfolder]: 8/59 cut-off events. [2022-12-13 09:37:38,034 INFO L131 PetriNetUnfolder]: For 86/94 co-relation queries the response was YES. [2022-12-13 09:37:38,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 59 events. 8/59 cut-off events. For 86/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 190 event pairs, 5 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 143. Up to 18 conditions per place. [2022-12-13 09:37:38,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 36 transitions, 155 flow [2022-12-13 09:37:38,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-13 09:37:38,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:38,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 09:37:38,038 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 155 flow [2022-12-13 09:37:38,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:38,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:38,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:37:38,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1144276244, now seen corresponding path program 1 times [2022-12-13 09:37:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696241373] [2022-12-13 09:37:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:38,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696241373] [2022-12-13 09:37:38,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696241373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:38,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:38,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127660488] [2022-12-13 09:37:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:38,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:38,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:37:38,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:38,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:38,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:37:38,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:38,474 INFO L130 PetriNetUnfolder]: 4893/6893 cut-off events. [2022-12-13 09:37:38,474 INFO L131 PetriNetUnfolder]: For 27495/28238 co-relation queries the response was YES. [2022-12-13 09:37:38,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19470 conditions, 6893 events. 4893/6893 cut-off events. For 27495/28238 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 39498 event pairs, 2314 based on Foata normal form. 327/3568 useless extension candidates. Maximal degree in co-relation 19452. Up to 5131 conditions per place. [2022-12-13 09:37:38,520 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 66 selfloop transitions, 23 changer transitions 6/101 dead transitions. [2022-12-13 09:37:38,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 101 transitions, 614 flow [2022-12-13 09:37:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:37:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:37:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 09:37:38,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.69375 [2022-12-13 09:37:38,522 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 155 flow. Second operand 5 states and 111 transitions. [2022-12-13 09:37:38,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 101 transitions, 614 flow [2022-12-13 09:37:38,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 571 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 09:37:38,536 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 316 flow [2022-12-13 09:37:38,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2022-12-13 09:37:38,536 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2022-12-13 09:37:38,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:38,539 INFO L89 Accepts]: Start accepts. Operand has 58 places, 58 transitions, 316 flow [2022-12-13 09:37:38,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:38,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:38,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 58 transitions, 316 flow [2022-12-13 09:37:38,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 316 flow [2022-12-13 09:37:38,755 INFO L130 PetriNetUnfolder]: 3616/5264 cut-off events. [2022-12-13 09:37:38,756 INFO L131 PetriNetUnfolder]: For 9675/13703 co-relation queries the response was YES. [2022-12-13 09:37:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17364 conditions, 5264 events. 3616/5264 cut-off events. For 9675/13703 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 33164 event pairs, 2210 based on Foata normal form. 3/2141 useless extension candidates. Maximal degree in co-relation 17348. Up to 4676 conditions per place. [2022-12-13 09:37:38,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 58 transitions, 316 flow [2022-12-13 09:37:38,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 09:37:38,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [245] L744-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 09:37:38,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [207] L732-->L737: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:37:38,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [223] L771-->L776: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:37:38,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [285] L732-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_211 (+ v_~__unbuffered_cnt~0_212 1)) (= |v_P0Thread1of1ForFork3_#res.offset_9| 0) (= |v_P0Thread1of1ForFork3_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_212} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-13 09:37:38,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [302] L771-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_263 (+ v_~__unbuffered_cnt~0_264 1)) (= |v_P3Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_264} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_9|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_263} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 09:37:38,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [284] L732-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_207 (+ v_~__unbuffered_cnt~0_208 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_208} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-13 09:37:39,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [301] L771-->P3FINAL: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_7| 0) (= |v_P3Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_259 (+ v_~__unbuffered_cnt~0_260 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_260} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_259} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 09:37:39,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [212] L744-->L749: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:37:39,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L797-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_227 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_227, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [244] L744-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 09:37:40,197 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:37:40,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1659 [2022-12-13 09:37:40,198 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 256 flow [2022-12-13 09:37:40,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:40,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:40,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:40,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:37:40,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1269256913, now seen corresponding path program 1 times [2022-12-13 09:37:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:40,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852426381] [2022-12-13 09:37:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:40,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852426381] [2022-12-13 09:37:40,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852426381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:40,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:40,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:37:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542831648] [2022-12-13 09:37:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:40,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:37:40,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:40,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:40,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:37:40,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:40,882 INFO L130 PetriNetUnfolder]: 6813/9534 cut-off events. [2022-12-13 09:37:40,882 INFO L131 PetriNetUnfolder]: For 24009/25000 co-relation queries the response was YES. [2022-12-13 09:37:40,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37533 conditions, 9534 events. 6813/9534 cut-off events. For 24009/25000 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 52786 event pairs, 1607 based on Foata normal form. 378/7083 useless extension candidates. Maximal degree in co-relation 37514. Up to 8047 conditions per place. [2022-12-13 09:37:40,941 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 72 selfloop transitions, 8 changer transitions 2/94 dead transitions. [2022-12-13 09:37:40,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 667 flow [2022-12-13 09:37:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:37:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:37:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 09:37:40,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2022-12-13 09:37:40,943 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 256 flow. Second operand 6 states and 106 transitions. [2022-12-13 09:37:40,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 667 flow [2022-12-13 09:37:40,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 634 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:40,980 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 283 flow [2022-12-13 09:37:40,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2022-12-13 09:37:40,980 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2022-12-13 09:37:40,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:40,980 INFO L89 Accepts]: Start accepts. Operand has 61 places, 51 transitions, 283 flow [2022-12-13 09:37:40,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:40,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:40,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 51 transitions, 283 flow [2022-12-13 09:37:40,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 51 transitions, 283 flow [2022-12-13 09:37:41,233 INFO L130 PetriNetUnfolder]: 4562/6544 cut-off events. [2022-12-13 09:37:41,233 INFO L131 PetriNetUnfolder]: For 9589/14602 co-relation queries the response was YES. [2022-12-13 09:37:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21110 conditions, 6544 events. 4562/6544 cut-off events. For 9589/14602 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 42079 event pairs, 2867 based on Foata normal form. 0/2688 useless extension candidates. Maximal degree in co-relation 21092. Up to 5962 conditions per place. [2022-12-13 09:37:41,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 51 transitions, 283 flow [2022-12-13 09:37:41,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 09:37:41,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:37:41,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-13 09:37:41,309 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 287 flow [2022-12-13 09:37:41,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:41,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:41,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:41,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:37:41,310 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1176056882, now seen corresponding path program 1 times [2022-12-13 09:37:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:41,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258008287] [2022-12-13 09:37:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:41,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258008287] [2022-12-13 09:37:41,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258008287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:41,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:41,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:41,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199527233] [2022-12-13 09:37:41,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:41,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:41,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:41,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 09:37:41,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:41,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:41,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 09:37:41,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:41,826 INFO L130 PetriNetUnfolder]: 6279/9340 cut-off events. [2022-12-13 09:37:41,826 INFO L131 PetriNetUnfolder]: For 23548/24137 co-relation queries the response was YES. [2022-12-13 09:37:41,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39185 conditions, 9340 events. 6279/9340 cut-off events. For 23548/24137 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 59718 event pairs, 1429 based on Foata normal form. 333/4785 useless extension candidates. Maximal degree in co-relation 39164. Up to 8008 conditions per place. [2022-12-13 09:37:41,870 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 50 selfloop transitions, 25 changer transitions 44/126 dead transitions. [2022-12-13 09:37:41,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 1027 flow [2022-12-13 09:37:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:37:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:37:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-12-13 09:37:41,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 09:37:41,872 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 287 flow. Second operand 6 states and 140 transitions. [2022-12-13 09:37:41,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 1027 flow [2022-12-13 09:37:41,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 126 transitions, 1007 flow, removed 10 selfloop flow, removed 0 redundant places. [2022-12-13 09:37:41,888 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 473 flow [2022-12-13 09:37:41,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=473, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2022-12-13 09:37:41,888 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2022-12-13 09:37:41,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:41,888 INFO L89 Accepts]: Start accepts. Operand has 69 places, 62 transitions, 473 flow [2022-12-13 09:37:41,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:41,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:41,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 62 transitions, 473 flow [2022-12-13 09:37:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 473 flow [2022-12-13 09:37:42,127 INFO L130 PetriNetUnfolder]: 3721/5556 cut-off events. [2022-12-13 09:37:42,127 INFO L131 PetriNetUnfolder]: For 15648/24192 co-relation queries the response was YES. [2022-12-13 09:37:42,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28139 conditions, 5556 events. 3721/5556 cut-off events. For 15648/24192 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 36076 event pairs, 1235 based on Foata normal form. 6/2388 useless extension candidates. Maximal degree in co-relation 28116. Up to 5056 conditions per place. [2022-12-13 09:37:42,167 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 473 flow [2022-12-13 09:37:42,167 INFO L226 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-13 09:37:42,172 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:42,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-13 09:37:42,173 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 473 flow [2022-12-13 09:37:42,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:42,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:42,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:37:42,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1234841147, now seen corresponding path program 1 times [2022-12-13 09:37:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:42,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969041649] [2022-12-13 09:37:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:42,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969041649] [2022-12-13 09:37:42,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969041649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:42,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:42,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:37:42,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071733561] [2022-12-13 09:37:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:42,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:37:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:42,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:37:42,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:37:42,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:37:42,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:42,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:42,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:37:42,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:42,680 INFO L130 PetriNetUnfolder]: 4130/6591 cut-off events. [2022-12-13 09:37:42,680 INFO L131 PetriNetUnfolder]: For 26592/27502 co-relation queries the response was YES. [2022-12-13 09:37:42,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38336 conditions, 6591 events. 4130/6591 cut-off events. For 26592/27502 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 45876 event pairs, 279 based on Foata normal form. 330/3548 useless extension candidates. Maximal degree in co-relation 38310. Up to 5653 conditions per place. [2022-12-13 09:37:42,714 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 52 selfloop transitions, 37 changer transitions 32/128 dead transitions. [2022-12-13 09:37:42,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 1271 flow [2022-12-13 09:37:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:37:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:37:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2022-12-13 09:37:42,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6830357142857143 [2022-12-13 09:37:42,715 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 473 flow. Second operand 7 states and 153 transitions. [2022-12-13 09:37:42,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 1271 flow [2022-12-13 09:37:42,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 1097 flow, removed 74 selfloop flow, removed 4 redundant places. [2022-12-13 09:37:42,826 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 619 flow [2022-12-13 09:37:42,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=619, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2022-12-13 09:37:42,826 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2022-12-13 09:37:42,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:42,826 INFO L89 Accepts]: Start accepts. Operand has 72 places, 74 transitions, 619 flow [2022-12-13 09:37:42,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:42,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:42,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 74 transitions, 619 flow [2022-12-13 09:37:42,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 74 transitions, 619 flow [2022-12-13 09:37:43,013 INFO L130 PetriNetUnfolder]: 2191/3630 cut-off events. [2022-12-13 09:37:43,013 INFO L131 PetriNetUnfolder]: For 11696/14615 co-relation queries the response was YES. [2022-12-13 09:37:43,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20667 conditions, 3630 events. 2191/3630 cut-off events. For 11696/14615 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 25147 event pairs, 272 based on Foata normal form. 11/1582 useless extension candidates. Maximal degree in co-relation 20643. Up to 3268 conditions per place. [2022-12-13 09:37:43,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 74 transitions, 619 flow [2022-12-13 09:37:43,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 09:37:43,038 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:43,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 09:37:43,039 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 619 flow [2022-12-13 09:37:43,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:43,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:43,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:43,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:37:43,040 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1593660626, now seen corresponding path program 1 times [2022-12-13 09:37:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:43,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218327268] [2022-12-13 09:37:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:43,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:43,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218327268] [2022-12-13 09:37:43,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218327268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:43,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:43,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:37:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864887957] [2022-12-13 09:37:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:43,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:37:43,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:37:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:37:43,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:37:43,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 619 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:43,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:43,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:37:43,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:43,502 INFO L130 PetriNetUnfolder]: 2285/3909 cut-off events. [2022-12-13 09:37:43,502 INFO L131 PetriNetUnfolder]: For 16071/16837 co-relation queries the response was YES. [2022-12-13 09:37:43,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24000 conditions, 3909 events. 2285/3909 cut-off events. For 16071/16837 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 27704 event pairs, 9 based on Foata normal form. 249/2171 useless extension candidates. Maximal degree in co-relation 23973. Up to 3277 conditions per place. [2022-12-13 09:37:43,518 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 25 selfloop transitions, 49 changer transitions 32/111 dead transitions. [2022-12-13 09:37:43,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 1133 flow [2022-12-13 09:37:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:37:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:37:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2022-12-13 09:37:43,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55859375 [2022-12-13 09:37:43,520 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 619 flow. Second operand 8 states and 143 transitions. [2022-12-13 09:37:43,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 1133 flow [2022-12-13 09:37:43,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 111 transitions, 959 flow, removed 62 selfloop flow, removed 5 redundant places. [2022-12-13 09:37:43,698 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 549 flow [2022-12-13 09:37:43,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2022-12-13 09:37:43,699 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2022-12-13 09:37:43,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:43,699 INFO L89 Accepts]: Start accepts. Operand has 75 places, 67 transitions, 549 flow [2022-12-13 09:37:43,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:43,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:43,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 67 transitions, 549 flow [2022-12-13 09:37:43,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 549 flow [2022-12-13 09:37:43,743 INFO L130 PetriNetUnfolder]: 594/1091 cut-off events. [2022-12-13 09:37:43,743 INFO L131 PetriNetUnfolder]: For 3937/4975 co-relation queries the response was YES. [2022-12-13 09:37:43,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5493 conditions, 1091 events. 594/1091 cut-off events. For 3937/4975 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 6602 event pairs, 0 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 5468. Up to 811 conditions per place. [2022-12-13 09:37:43,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 67 transitions, 549 flow [2022-12-13 09:37:43,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-13 09:37:44,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [314] $Ultimate##0-->L749: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= v_~x~0_67 1) (= (+ v_~__unbuffered_cnt~0_1086 1) v_~__unbuffered_cnt~0_1085)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1086} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1085, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0] and [329] $Ultimate##0-->L759: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_11 |v_P2Thread1of1ForFork2_#in~arg.offset_11|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_95) (= v_~__unbuffered_p2_EBX~0_101 v_~y~0_69) (= |v_P2Thread1of1ForFork2_#in~arg.base_11| v_P2Thread1of1ForFork2_~arg.base_11)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_101, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_11, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:37:44,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [315] $Ultimate##0-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19) (= (+ v_~__unbuffered_cnt~0_1090 1) v_~__unbuffered_cnt~0_1089) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= |v_P1Thread1of1ForFork1_#res.offset_119| 0) (= v_~x~0_69 1) (= 0 |v_P1Thread1of1ForFork1_#res.base_119|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1090} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_119|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1089, ~x~0=v_~x~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_119|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [329] $Ultimate##0-->L759: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_11 |v_P2Thread1of1ForFork2_#in~arg.offset_11|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_95) (= v_~__unbuffered_p2_EBX~0_101 v_~y~0_69) (= |v_P2Thread1of1ForFork2_#in~arg.base_11| v_P2Thread1of1ForFork2_~arg.base_11)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_101, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_11, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:37:44,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] $Ultimate##0-->P1EXIT: Formula: (and (= v_~x~0_71 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_21| v_P1Thread1of1ForFork1_~arg.offset_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_121|) (= |v_P1Thread1of1ForFork1_#res.offset_121| 0) (= v_P1Thread1of1ForFork1_~arg.base_21 |v_P1Thread1of1ForFork1_#in~arg.base_21|) (= v_~__unbuffered_cnt~0_1093 (+ v_~__unbuffered_cnt~0_1094 1))) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1094} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_121|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1093, ~x~0=v_~x~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_121|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [329] $Ultimate##0-->L759: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_11 |v_P2Thread1of1ForFork2_#in~arg.offset_11|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_95) (= v_~__unbuffered_p2_EBX~0_101 v_~y~0_69) (= |v_P2Thread1of1ForFork2_#in~arg.base_11| v_P2Thread1of1ForFork2_~arg.base_11)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_101, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_11, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:37:44,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] $Ultimate##0-->L744: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_17 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] and [329] $Ultimate##0-->L759: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_11 |v_P2Thread1of1ForFork2_#in~arg.offset_11|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_95) (= v_~__unbuffered_p2_EBX~0_101 v_~y~0_69) (= |v_P2Thread1of1ForFork2_#in~arg.base_11| v_P2Thread1of1ForFork2_~arg.base_11)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_101, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_11, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_69, ~x~0=v_~x~0_97} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:37:44,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [330] $Ultimate##0-->P0EXIT: Formula: (and (= v_~y~0_71 v_~__unbuffered_p0_EAX~0_102) (= v_~__unbuffered_p0_EBX~0_124 v_~x~0_99) (= |v_P0Thread1of1ForFork3_#res.offset_147| 0) (= |v_P0Thread1of1ForFork3_#res.base_147| 0) (= (+ v_~__unbuffered_cnt~0_1146 1) v_~__unbuffered_cnt~0_1145) (= |v_P0Thread1of1ForFork3_#in~arg.offset_23| v_P0Thread1of1ForFork3_~arg.offset_23) (= v_P0Thread1of1ForFork3_~arg.base_23 |v_P0Thread1of1ForFork3_#in~arg.base_23|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1146, ~y~0=v_~y~0_71, ~x~0=v_~x~0_99, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_23|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_102, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_124, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_23|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_23, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_147|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1145, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_147|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_23, ~y~0=v_~y~0_71, ~x~0=v_~x~0_99, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_23|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [331] $Ultimate##0-->P0FINAL: Formula: (and (= v_~__unbuffered_p0_EBX~0_126 v_~x~0_101) (= |v_P0Thread1of1ForFork3_#res.offset_149| 0) (= |v_P0Thread1of1ForFork3_#in~arg.offset_25| v_P0Thread1of1ForFork3_~arg.offset_25) (= (+ v_~__unbuffered_cnt~0_1150 1) v_~__unbuffered_cnt~0_1149) (= |v_P0Thread1of1ForFork3_#res.base_149| 0) (= v_P0Thread1of1ForFork3_~arg.base_25 |v_P0Thread1of1ForFork3_#in~arg.base_25|) (= v_~y~0_73 v_~__unbuffered_p0_EAX~0_104)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1150, ~y~0=v_~y~0_73, ~x~0=v_~x~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_25|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_126, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_25|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_25, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_149|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1149, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_149|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_25, ~y~0=v_~y~0_73, ~x~0=v_~x~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_25|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [332] $Ultimate##0-->L737: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_27 |v_P0Thread1of1ForFork3_#in~arg.base_27|) (= v_~y~0_75 v_~__unbuffered_p0_EAX~0_106) (= (+ v_~__unbuffered_cnt~0_1154 1) v_~__unbuffered_cnt~0_1153) (= v_~__unbuffered_p0_EBX~0_128 v_~x~0_103) (= |v_P0Thread1of1ForFork3_#in~arg.offset_27| v_P0Thread1of1ForFork3_~arg.offset_27)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1154, ~y~0=v_~y~0_75, ~x~0=v_~x~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_27|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_128, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_27|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_27, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1153, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_27, ~y~0=v_~y~0_75, ~x~0=v_~x~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_27|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [333] $Ultimate##0-->L737: Formula: (and (= (+ v_~__unbuffered_cnt~0_1158 1) v_~__unbuffered_cnt~0_1157) (= v_P0Thread1of1ForFork3_~arg.base_29 |v_P0Thread1of1ForFork3_#in~arg.base_29|) (= v_~y~0_77 v_~__unbuffered_p0_EAX~0_108) (= |v_P0Thread1of1ForFork3_#in~arg.offset_29| v_P0Thread1of1ForFork3_~arg.offset_29) (= v_~__unbuffered_p0_EBX~0_130 v_~x~0_105)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1158, ~y~0=v_~y~0_77, ~x~0=v_~x~0_105, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_29|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_108, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_130, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_29|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_29, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1157, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_29, ~y~0=v_~y~0_77, ~x~0=v_~x~0_105, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_29|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [334] $Ultimate##0-->L737: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_31| v_P0Thread1of1ForFork3_~arg.offset_31) (= v_~__unbuffered_p0_EBX~0_132 v_~x~0_107) (= (+ v_~__unbuffered_cnt~0_1162 1) v_~__unbuffered_cnt~0_1161) (= v_P0Thread1of1ForFork3_~arg.base_31 |v_P0Thread1of1ForFork3_#in~arg.base_31|) (= v_~y~0_79 v_~__unbuffered_p0_EAX~0_110)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1162, ~y~0=v_~y~0_79, ~x~0=v_~x~0_107, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_132, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_31|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_31, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1161, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_31, ~y~0=v_~y~0_79, ~x~0=v_~x~0_107, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_31|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [335] $Ultimate##0-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_33| v_P0Thread1of1ForFork3_~arg.offset_33) (= v_~__unbuffered_cnt~0_1165 (+ v_~__unbuffered_cnt~0_1166 1)) (= v_~__unbuffered_p0_EBX~0_134 v_~x~0_109) (= |v_P0Thread1of1ForFork3_#res.base_151| 0) (= v_P0Thread1of1ForFork3_~arg.base_33 |v_P0Thread1of1ForFork3_#in~arg.base_33|) (= |v_P0Thread1of1ForFork3_#res.offset_151| 0) (= v_~y~0_81 v_~__unbuffered_p0_EAX~0_112)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1166, ~y~0=v_~y~0_81, ~x~0=v_~x~0_109, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_33|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_112, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_134, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_33|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_33, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_151|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1165, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_151|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_33, ~y~0=v_~y~0_81, ~x~0=v_~x~0_109, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_33|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [336] $Ultimate##0-->P0EXIT: Formula: (and (= v_~y~0_83 v_~__unbuffered_p0_EAX~0_114) (= |v_P0Thread1of1ForFork3_#res.offset_153| 0) (= |v_P0Thread1of1ForFork3_#in~arg.offset_35| v_P0Thread1of1ForFork3_~arg.offset_35) (= v_P0Thread1of1ForFork3_~arg.base_35 |v_P0Thread1of1ForFork3_#in~arg.base_35|) (= v_~__unbuffered_p0_EBX~0_136 v_~x~0_111) (= |v_P0Thread1of1ForFork3_#res.base_153| 0) (= (+ v_~__unbuffered_cnt~0_1170 1) v_~__unbuffered_cnt~0_1169)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1170, ~y~0=v_~y~0_83, ~x~0=v_~x~0_111, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_35|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_35|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_35, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_153|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1169, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_153|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_35, ~y~0=v_~y~0_83, ~x~0=v_~x~0_111, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_35|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [337] $Ultimate##0-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_155| 0) (= |v_P0Thread1of1ForFork3_#res.base_155| 0) (= v_~y~0_85 v_~__unbuffered_p0_EAX~0_116) (= v_P0Thread1of1ForFork3_~arg.base_37 |v_P0Thread1of1ForFork3_#in~arg.base_37|) (= (+ v_~__unbuffered_cnt~0_1174 1) v_~__unbuffered_cnt~0_1173) (= v_~__unbuffered_p0_EBX~0_138 v_~x~0_113) (= |v_P0Thread1of1ForFork3_#in~arg.offset_37| v_P0Thread1of1ForFork3_~arg.offset_37)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1174, ~y~0=v_~y~0_85, ~x~0=v_~x~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_37|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_138, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_37|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_37, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1173, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_155|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_37, ~y~0=v_~y~0_85, ~x~0=v_~x~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_37|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [338] $Ultimate##0-->P0FINAL: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_39 |v_P0Thread1of1ForFork3_#in~arg.base_39|) (= |v_P0Thread1of1ForFork3_#res.offset_157| 0) (= v_~__unbuffered_p0_EBX~0_140 v_~x~0_115) (= |v_P0Thread1of1ForFork3_#in~arg.offset_39| v_P0Thread1of1ForFork3_~arg.offset_39) (= |v_P0Thread1of1ForFork3_#res.base_157| 0) (= v_~__unbuffered_cnt~0_1177 (+ v_~__unbuffered_cnt~0_1178 1)) (= v_~y~0_87 v_~__unbuffered_p0_EAX~0_118)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1178, ~y~0=v_~y~0_87, ~x~0=v_~x~0_115, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_118, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_140, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_39|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_39, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_157|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1177, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_157|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_39, ~y~0=v_~y~0_87, ~x~0=v_~x~0_115, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_39|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [339] $Ultimate##0-->L737: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_41| v_P0Thread1of1ForFork3_~arg.offset_41) (= (+ v_~__unbuffered_cnt~0_1182 1) v_~__unbuffered_cnt~0_1181) (= v_P0Thread1of1ForFork3_~arg.base_41 |v_P0Thread1of1ForFork3_#in~arg.base_41|) (= v_~y~0_89 v_~__unbuffered_p0_EAX~0_120) (= v_~__unbuffered_p0_EBX~0_142 v_~x~0_117)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_41|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1182, ~y~0=v_~y~0_89, ~x~0=v_~x~0_117, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_120, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_142, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_41|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1181, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_41, ~y~0=v_~y~0_89, ~x~0=v_~x~0_117, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_41|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [340] $Ultimate##0-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.base_159| 0) (= |v_P0Thread1of1ForFork3_#res.offset_159| 0) (= v_~__unbuffered_p0_EBX~0_144 v_~x~0_119) (= v_~y~0_91 v_~__unbuffered_p0_EAX~0_122) (= v_P0Thread1of1ForFork3_~arg.base_43 |v_P0Thread1of1ForFork3_#in~arg.base_43|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_43| v_P0Thread1of1ForFork3_~arg.offset_43) (= (+ v_~__unbuffered_cnt~0_1186 1) v_~__unbuffered_cnt~0_1185)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_43|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1186, ~y~0=v_~y~0_91, ~x~0=v_~x~0_119, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_43|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_122, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_144, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_43|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_43, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_159|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1185, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_159|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_43, ~y~0=v_~y~0_91, ~x~0=v_~x~0_119, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_43|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:44,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] $Ultimate##0-->L771: Formula: (and (= v_~y~0_15 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [341] $Ultimate##0-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_45| v_P0Thread1of1ForFork3_~arg.offset_45) (= (+ v_~__unbuffered_cnt~0_1190 1) v_~__unbuffered_cnt~0_1189) (= v_~__unbuffered_p0_EBX~0_146 v_~x~0_121) (= v_~y~0_93 v_~__unbuffered_p0_EAX~0_124) (= v_P0Thread1of1ForFork3_~arg.base_45 |v_P0Thread1of1ForFork3_#in~arg.base_45|) (= |v_P0Thread1of1ForFork3_#res.offset_161| 0) (= |v_P0Thread1of1ForFork3_#res.base_161| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1190, ~y~0=v_~y~0_93, ~x~0=v_~x~0_121, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_45|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_146, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_45|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_45, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_161|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1189, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_161|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_45, ~y~0=v_~y~0_93, ~x~0=v_~x~0_121, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_45|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] [2022-12-13 09:37:45,026 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 09:37:45,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1328 [2022-12-13 09:37:45,027 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 695 flow [2022-12-13 09:37:45,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:45,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:45,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:45,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:37:45,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2046240036, now seen corresponding path program 1 times [2022-12-13 09:37:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161169249] [2022-12-13 09:37:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:45,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161169249] [2022-12-13 09:37:45,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161169249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:45,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:45,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489060861] [2022-12-13 09:37:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:45,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:45,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:45,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-13 09:37:45,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 695 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:45,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:45,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-13 09:37:45,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:45,153 INFO L130 PetriNetUnfolder]: 339/590 cut-off events. [2022-12-13 09:37:45,153 INFO L131 PetriNetUnfolder]: For 4724/4724 co-relation queries the response was YES. [2022-12-13 09:37:45,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 590 events. 339/590 cut-off events. For 4724/4724 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 2822 event pairs, 0 based on Foata normal form. 81/468 useless extension candidates. Maximal degree in co-relation 3616. Up to 433 conditions per place. [2022-12-13 09:37:45,155 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 0 selfloop transitions, 0 changer transitions 60/60 dead transitions. [2022-12-13 09:37:45,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 700 flow [2022-12-13 09:37:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:37:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:37:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 09:37:45,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34594594594594597 [2022-12-13 09:37:45,156 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 695 flow. Second operand 5 states and 64 transitions. [2022-12-13 09:37:45,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 700 flow [2022-12-13 09:37:45,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 352 flow, removed 71 selfloop flow, removed 18 redundant places. [2022-12-13 09:37:45,163 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2022-12-13 09:37:45,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2022-12-13 09:37:45,172 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-12-13 09:37:45,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:45,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 0 transitions, 0 flow [2022-12-13 09:37:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:37:45,172 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:37:45,172 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:45,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 09:37:45,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:37:45,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:37:45,173 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:45,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 09:37:45,174 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:37:45,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:45,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:37:45,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 09:37:45,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:37:45,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:37:45,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 09:37:45,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:37:45,176 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:45,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:37:45,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:37:45,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:37:45 BasicIcfg [2022-12-13 09:37:45,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:37:45,183 INFO L158 Benchmark]: Toolchain (without parser) took 14214.45ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 153.0MB in the beginning and 385.0MB in the end (delta: -232.0MB). Peak memory consumption was 674.9MB. Max. memory is 8.0GB. [2022-12-13 09:37:45,183 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:37:45,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.19ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 128.9MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 09:37:45,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.62ms. Allocated memory is still 178.3MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:37:45,184 INFO L158 Benchmark]: Boogie Preprocessor took 25.44ms. Allocated memory is still 178.3MB. Free memory was 126.8MB in the beginning and 125.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:37:45,184 INFO L158 Benchmark]: RCFGBuilder took 315.51ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 110.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 09:37:45,184 INFO L158 Benchmark]: TraceAbstraction took 13479.29ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 109.4MB in the beginning and 385.0MB in the end (delta: -275.6MB). Peak memory consumption was 631.9MB. Max. memory is 8.0GB. [2022-12-13 09:37:45,185 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.15ms. Allocated memory is still 178.3MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.19ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 128.9MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.62ms. Allocated memory is still 178.3MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.44ms. Allocated memory is still 178.3MB. Free memory was 126.8MB in the beginning and 125.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 315.51ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 110.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13479.29ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 109.4MB in the beginning and 385.0MB in the end (delta: -275.6MB). Peak memory consumption was 631.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 94 PlacesBefore, 45 PlacesAfterwards, 82 TransitionsBefore, 33 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 62 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1925, independent: 1864, independent conditional: 1864, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1472, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1472, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1472, independent: 1356, independent conditional: 0, independent unconditional: 1356, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1925, independent: 434, independent conditional: 434, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 1472, unknown conditional: 1472, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1472, Positive cache size: 1430, Positive conditional cache size: 1430, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 230, independent conditional: 230, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 213, independent conditional: 13, independent unconditional: 200, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 230, independent: 213, independent conditional: 13, independent unconditional: 200, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 230, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 230, unknown conditional: 230, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 213, Positive conditional cache size: 213, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 253, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 33, independent conditional: 15, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 33, independent conditional: 15, independent unconditional: 18, 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: 37, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 253, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 246, Positive conditional cache size: 246, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 253, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 27, independent conditional: 16, independent unconditional: 11, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 27, independent conditional: 16, independent unconditional: 11, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 1, dependent unconditional: 4, 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: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 253, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 273, Positive conditional cache size: 273, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 842 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 43, independent unconditional: 14, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 43, independent unconditional: 14, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 330, Positive conditional cache size: 330, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 352, Positive conditional cache size: 352, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 371, Positive conditional cache size: 371, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 58 PlacesBefore, 56 PlacesAfterwards, 58 TransitionsBefore, 48 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 207, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 0, independent unconditional: 95, 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: 207, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 95, unknown conditional: 95, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 466, Positive conditional cache size: 466, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 486, Positive conditional cache size: 486, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 486, Positive conditional cache size: 486, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 486, Positive conditional cache size: 486, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 69 PlacesBefore, 62 PlacesAfterwards, 67 TransitionsBefore, 61 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 764, independent: 764, independent conditional: 764, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 126, independent conditional: 125, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, independent: 126, independent conditional: 125, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, independent: 126, independent conditional: 0, independent unconditional: 126, 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: 764, independent: 638, independent conditional: 638, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 126, unknown conditional: 126, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 642, Positive cache size: 612, Positive conditional cache size: 612, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 642, Positive cache size: 612, Positive conditional cache size: 612, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 129 locations, 5 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: 13.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1092 IncrementalHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 11 mSDtfsCounter, 1092 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=695occurred in iteration=11, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:37:45,224 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...